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<bits/stdc++.h>
#define ALL(X)        X.begin(),X.end()
#define FOR(I,A,B)    for(int (I) = (A); (I) <= (B); (I)++)
#define FORW(I,A,B)   for(int (I) = (A); (I) < (B);  (I)++)
#define FORD(I,A,B)   for(int (I) = (A); (I) >= (B); (I)--)
#define CLEAR(X)      memset(X,0,sizeof(X))
#define SIZE(X)       int(X.size())
#define CONTAINS(A,X) (A.find(X) != A.end())
#define PB            push_back
#define MP            make_pair
#define X             first
#define Y             second
using namespace std;
template<typename T, typename U> ostream& operator << (ostream& os, const pair<T, U> &_p) { return os << "(" << _p.X << "," << _p.Y << ")"; }
template<typename T> ostream& operator << (ostream &os, const vector<T>& _V) { bool f = true; os << "["; for(auto v: _V) { os << (f ? "" : ",") << v; f = false; } return os << "]"; }
template<typename T> ostream& operator << (ostream &os, const set<T>& _S) { bool f = true; os << "("; for(auto s: _S) { os << (f ? "" : ",") << s; f = false; } return os << ")"; }
template<typename T, typename U> ostream& operator << (ostream &os, const map<T, U>& _M) { return os << set<pair<T, U>>(ALL(_M)); }
typedef signed long long slong;
typedef long double ldouble;
const slong INF = 1000000100;
const ldouble EPS = 1e-9;

map<pair<int,pair<int,int>>, int> H;

vector<int> V[100100];
int n;

const int mod = 1000033;

slong mH[100100];
int Odw[100100], diff;

pair<int,int> ans;
map<int,int> Ile;

long long S1[100100];
long long S2[100100];
long long S3[100100];

int HASH(long long a, long long b, long long c ) {
	a = (a%mod+mod)%mod;
	b = (b%mod+mod)%mod;
	c = (c%mod+mod)%mod;
	if(H.find(MP(a,MP(b,c))) == H.end()) {
		H[MP(a,MP(b,c))] = rand()%mod;
	}
	return H[MP(a,MP(b,c))];
}
void dfs(int a) {
	Odw[a] = 1;
	slong s1 = 0;
	slong s2 = 0;
	slong s3 = 0;
	for(int v : V[a]) {
		if(Odw[v]) continue;
		dfs(v);
		s1 += mH[v];
		s2 += mH[v]*mH[v]%mod;
		s3 += mH[v]*mH[v]%mod*mH[v]%mod;
	}
	s1 = s1%mod;
	s2 = s2%mod;
	s3 = s3%mod;
	
	mH[a] = HASH(s1,s2,s3);
	S1[a] = s1;
	S2[a] = s2;
	S3[a] = s3;
}

#define cerr if(0)cerr

int GW[100100];
void go(int a, long long gg) {
	Ile[mH[a]]--;
	if(Ile[mH[a]] == 0) diff--;

	int mnh = HASH((S1[a]+gg)%mod, (S2[a] + gg*gg)%mod, (S3[a]+gg*gg%mod*gg)%mod);
	if(Ile[mnh] == 0) diff++;
	Ile[mnh]++;

	ans = max(ans, MP(diff, a));
	cerr << diff << " a:" << a << " " << "\n";

	if(Ile[mnh] == 1) diff--;
	Ile[mnh]--;
	GW[a] = 1;

	for(int v : V[a]) {
		if(GW[v]) continue;
		slong ns1 = (mod + S1[a] - mH[v] + gg)%mod;
		slong ns2 = (mod + S2[a] - mH[v]*mH[v] + gg*gg)%mod;
		slong ns3 = (mod + S3[a] - mH[v]*mH[v]%mod*mH[v]%mod + gg*gg%mod*gg)%mod;
		int nh = HASH(ns1, ns2 ,ns3);
		if(Ile[nh] == 0) diff++;
		Ile[nh]++;

		go(v, nh);

		Ile[nh]--;
		if(Ile[nh] == 0) diff--;
		

	}
	Ile[mH[a]]++;
	if(Ile[mH[a]] == 1) diff++;

}

int main() { 
	srand(time(NULL));
	scanf("%d",&n);
	FORW(i,1,n) {
		int a,b;
		scanf("%d%d", &a,&b);
		V[a].PB(b);
		V[b].PB(a);
	}
	dfs(1);
	FOR(i,1,n) {
		Ile[mH[i]]++;
		if(Ile[mH[i]] == 1) diff++;
	}
	go(1, 0);
	cout << ans.second << endl;;
	if(n > 1000) cout << ans.first << endl;
}
