#include<vector>
#include<algorithm>
#include<cstring>
#include<stdio.h>
using namespace std;
#define MAXN 1000
vector<int>a[MAXN];
int Get_num(int son,int fa){
int t = 1;
for(int i = 0; i < a[son].size(); i++){
if(a[son][i] == fa) continue;
t += Get_num(a[son][i],son);
}
return t;
}
int sum(int n){
int q = 0;
for(int i = 0; i < a[n].size(); i++){
q = max(q,Get_num(a[n][i],n));
}
return q;
}
int main()
{
int n;
scanf("%d",&n);
for(int i = 0; i < n-1; i++){\
int c,d;
scanf("%d%d",&c,&d);
a[c].push_back(d);
a[d].push_back(c);
}
int x = MAXN;
for(int i = 1; i <= n; i++){
x = min(x,sum(i));
}
printf("%d\n",x);
}