#include <stdio.h>
#include <string.h>

#define maxn 1010

int n,m,now,visit[maxn],map[maxn][maxn];
long ans;
FILE *f1,*f2;

void search(int x)
{
	int i,y;
	for (i=1;i<=map[x][0];i++)
	{
		y=map[x][i];
		if (visit[y]==0)
		{
			visit[y]=1;
			now++;
			search(y);
		}
	}
}

void run(void)
{
	int i,zan=0;
	for (i=0;i<n;i++)
	{
		if (map[i][0]!=0)
		{
			now=0;
			memset(visit,0,sizeof(visit));
			//visit[i]=1;
			search(i);
			if (now>zan)
				zan=now;
		}
	}
	ans=2*m-zan;
}

void ini(void)
{
	int i,a,b;
	n=0;
	fscanf(f1,"%d",&m);
	for (i=0;i<m;i++)
	{
		fscanf(f1,"%d%d",&a,&b);
		map[a][++map[a][0]]=b;
		if (a>n)
			n=a;
		if (b>n)
			n=b;
	}
}

int main(void)
{
	f1=fopen("pie.in","r");
	f2=fopen("pie.out","w");
	ini();
	run();
	fprintf(f2,"%ld\n",ans);
	fclose(f1);fclose(f2);
	return 0;
}