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>
using namespace std;
long long base1 = 403007, base2 = 403963, p1 = 1e9 + 7, p2 = 1e9 + 9,
          po1[400005], po2[400005];
int n;
vector<int> adj[100005];
map<pair<int, int>, int> mp;
int ty[100005], cnt = 0;
pair<int, int> hsh[100005];
void dfs(int x, int p) {
  long long hsh1 = 0, hsh2 = 0;
  for (auto nxt : adj[x]) {
    if (nxt == p) continue;
    dfs(nxt, x);
    hsh1 += po1[ty[nxt]];
    hsh1 %= p1;
    hsh2 += po2[ty[nxt]];
    hsh2 %= p2;
  }
  if (!mp.count({hsh1, hsh2})) mp[{hsh1, hsh2}] = cnt++;
  ty[x] = mp[{hsh1, hsh2}];
  hsh[x] = {hsh1, hsh2};
}
int id = 1, mx = 0, now, num[400005];
void dfs1(int x, int p) {
  if (p) {
    long long hsh1 = hsh[p].first, hsh2 = hsh[p].second;
    hsh1 = (hsh1 - po1[ty[x]] + p1) % p1;
    hsh2 = (hsh2 - po2[ty[x]] + p2) % p2;
    if (num[ty[p]] == 1)
      --now;
    else if (num[ty[p]] == 2)
      ++now;
    --num[ty[p]];
    hsh[p] = {hsh1, hsh2};
    if (!mp.count(hsh[p])) mp[hsh[p]] = cnt++;
    ty[p] = mp[hsh[p]];
    ++num[ty[p]];
    if (num[ty[p]] == 1)
      ++now;
    else if (num[ty[p]] == 2)
      --now;
    hsh1 = hsh[x].first, hsh2 = hsh[x].second;
    hsh1 = (hsh1 + po1[ty[p]] + p1) % p1;
    hsh2 = (hsh2 + po2[ty[p]] + p2) % p2;
    if (num[ty[x]] == 1)
      --now;
    else if (num[ty[p]] == 2)
      ++now;
    --num[ty[p]];
    hsh[x] = {hsh1, hsh2};
    if (!mp.count(hsh[x])) mp[hsh[x]] = cnt++;
    ty[x] = mp[hsh[x]];
    ++num[ty[x]];
    if (num[ty[x]] == 1)
      ++now;
    else if (num[ty[x]] == 2)
      --now;
  }
  if (mx < now) {
    mx = now;
    id = x;
  }
  for (auto nxt : adj[x]) {
    if (nxt != p) dfs1(nxt, x);
  }
  long long hsh1 = hsh[x].first, hsh2 = hsh[x].second;
  hsh1 = (hsh1 - po1[ty[p]] + p1) % p1;
  hsh2 = (hsh2 - po2[ty[p]] + p2) % p2;
  if (num[ty[x]] == 1)
    --now;
  else if (num[ty[p]] == 2)
    ++now;
  --num[ty[p]];
  hsh[x] = {hsh1, hsh2};
  ty[x] = mp[hsh[x]];
  ++num[ty[x]];
  if (num[ty[x]] == 1)
    ++now;
  else if (num[ty[x]] == 2)
    --now;
  hsh1 = hsh[p].first, hsh2 = hsh[p].second;
  hsh1 = (hsh1 + po1[ty[x]] + p1) % p1;
  hsh2 = (hsh2 + po2[ty[x]] + p2) % p2;
  if (num[ty[p]] == 1)
    --now;
  else if (num[ty[p]] == 2)
    ++now;
  --num[ty[p]];
  hsh[p] = {hsh1, hsh2};
  ty[p] = mp[hsh[p]];
  ++num[ty[p]];
  if (num[ty[p]] == 1)
    ++now;
  else if (num[ty[p]] == 2)
    --now;
}
int main() {
  po1[0] = po2[0] = 1;
  for (int i = 1; i < 400005; ++i) {
    po1[i] = (po1[i - 1] * base1) % p1;
    po2[i] = (po2[i - 1] * base2) % p2;
  }
  cin >> n;
  for (int i = 1; i < n; ++i) {
    int u, v;
    scanf("%d%d", &u, &v);
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  dfs(1, 0);
  for (int i = 1; i <= n; ++i) ++num[ty[i]];
  for (int i = 0; i < cnt; ++i)
    if (num[i] == 1) ++mx;
  now = mx;
  dfs1(1, 0);
  cout << id << endl;
  if (n == 100000) cout << mx << endl;
}
