10
6 8
3 10
1 9
6 1
8 2
5 7
3 6
10 4
3 5
 1
 5
1 2
2 3
3 4
4 5
 7
2 3
2 6
1 2
3 7
6 5
3 4
 10
8 4
8 10
8 1
8 2
5 9
5 3
5 7
8 5
5 6
 10
8 6
3 4
10 9
7 10
1 3
4 2
6 1
5 8
9 5
 10
1 10
6 9
5 4
1 3
1 2
3 8
6 7
8 6
1 5
 20
13 4
7 6
9 13
9 2
9 16
4 18
16 5
11 15
16 14
13 12
13 8
16 17
7 1
9 19
17 3
15 20
1 11
2 7
5 10
 3
1 2
1 3
 50
18 47
18 12
42 16
21 44
43 39
20 27
25 1
11 29
9 24
19 42
3 34
16 38
14 48
23 41
8 43
29 2
40 4
45 36
43 9
49 3
41 17
41 15
35 49
43 20
5 32
34 46
8 21
43 45
29 40
39 26
27 33
24 50
38 7
39 19
43 31
24 10
3 14
39 22
43 23
47 13
20 11
25 8
16 30
44 18
19 37
39 5
49 28
25 35
46 6
 15
11 2
5 13
9 4
5 7
11 5
13 14
2 10
3 11
7 1
7 6
10 15
9 12
2 9
10 8
 31
15 2
23 19
11 4
26 6
1 20
14 11
19 13
26 12
12 27
20 14
22 21
4 16
10 18
5 23
4 31
12 8
2 17
19 30
14 26
2 28
22 7
23 9
20 5
5 15
9 29
15 10
6 25
6 24
9 3
11 22
 63
34 40
43 62
33 43
49 6
17 47
26 13
35 15
40 16
17 44
37 34
18 55
57 10
16 14
39 56
36 5
4 33
4 59
54 24
37 45
21 31
57 2
19 8
43 41
49 48
15 19
35 4
15 63
30 50
11 30
59 18
20 46
18 1
33 17
31 22
40 54
63 49
29 25
46 9
16 3
42 23
59 7
54 53
42 38
8 60
8 58
7 51
36 28
63 36
21 57
25 37
45 20
25 35
19 26
20 42
30 32
11 39
7 12
31 52
45 21
26 27
34 11
46 61

9
 1
 1
 1
 1
 2
 10
 18
 2
 13
 1
 3
 1

#include<cmath>
#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstring>
#include<map>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
int getint(){
	int x=0,f=1;
	char ch=getchar();
	while(ch<'0'||'9'<ch){if(ch=='-')f=-1;ch=getchar();}
	while('0'<=ch&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return f*x;
}
#define N 112345
int head[N],etot;
struct edge{
	int to,next;
}e[N<<1];
void insert(int x,int y){
	e[++etot].to=y; e[etot].next=head[x]; head[x]=etot;
	e[++etot].to=x; e[etot].next=head[y]; head[y]=etot;
}
ull f[N],h[N];
int fa[N];
ull hash(ull x){
	return x*x*x*x*ull("Orz_st_nec!!!")+x*x*x*ull("asdasdasdasdfwe")+x*x*ull("Rp+++++")+x*ull("heartstonebuchucheng")+ull("youbiaokachibugudu???");
}
void dfs(int x){
	for(int i=head[x];i;i=e[i].next){
		int y=e[i].to;
		if(y!=fa[x]){
			fa[y]=x; dfs(y); f[x]+=f[y];
		}
	}
	f[x]=hash(f[x]);
//	cout<<x<<" "<<f[x]<<endl;
	return ;
}
void dfs2(int x){
	ull sum=h[x]; 
//	cout<<x<<" "<<h[x]<<endl;
	for(int i=head[x];i;i=e[i].next) {
		int y=e[i].to;
		if(y!=fa[x]){ sum+=f[y]; }
	}
	for(int i=head[x];i;i=e[i].next){
		int y=e[i].to;
		if(y!=fa[x]){
			h[y]=hash(sum-f[y]);
			dfs2(y);
		}
	}
}
map<ull,int> mp; 
int cnt=0;
int ans,ansi;
void add(ull x){ if(mp[x]==0) cnt++; mp[x]++; }
void del(ull x){ if(mp[x]==1) cnt--; mp[x]--; }
void dfs3(int x){
	if(cnt>ans) ansi=x,ans=cnt;
	for(int i=head[x];i;i=e[i].next) {
		int y=e[i].to;
		if(y!=fa[x]){ 
			del(f[y]); add(h[y]);
			dfs3(y);
			add(f[y]); del(h[y]);
		}
	}
	return ;
}
int main(){
	int n=getint();
	for(int i=1;i<n;i++) {
		insert(getint(),getint());
	}
	dfs(1); dfs2(1);
	for(int i=2;i<=n;i++) add(f[i]);
	ans=-1;
	dfs3(1);
	cout<<ansi<<endl;
	return 0;
}


