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>
const long long MOD = 998244353, BAS = 1231231, TAG = 445337;
int N, head[100001], next[199999], to[199999], E;
long long f[100001], g[100001], powBAS[100001];
int q[100001], ue[100001], fa[100001], size[100001];
void BFS() {
  int H = 0, T = 1, u;
  q[1] = 1;
  while (H < T)
    for (int e = head[u = q[++H]]; e; e = next[e])
      if (to[e] != fa[u]) fa[q[++T] = to[e]] = u;
  static long long list_of_f[100001];
  for (int i = N; i; i--) {
    int u = q[i], L = 0;
    size[u] = 1;
    for (int e = head[u]; e; e = next[e])
      if (to[e] != fa[u]) {
        size[u] += size[to[e]];
        list_of_f[++L] = (f[to[e]] * TAG + 1) % MOD;
      }
    std::sort(list_of_f + 1, list_of_f + L + 1);
    f[u] = 0;
    for (int j = 1; j <= L; j++) f[u] = (f[u] * BAS + list_of_f[j]) % MOD;
    f[u] = (f[u] + TAG) % MOD;
  }
  for (int i = 1; i <= N; i++) {
    int u = q[i], L = 0;
    if (u != 1) list_of_f[++L] = (g[u] * TAG + 1) % MOD;
    for (int e = head[u]; e; e = next[e])
      if (to[e] != fa[u]) list_of_f[++L] = (f[to[e]] * TAG + 1) % MOD;
    std::sort(list_of_f + 1, list_of_f + L + 1);
    static long long prefix[100001];
    prefix[0] = 0;
    for (int i = 1; i <= L; i++)
      prefix[i] = (prefix[i - 1] * BAS + list_of_f[i]) % MOD;
    for (int e = head[u]; e; e = next[e])
      if (to[e] != fa[u]) {
        int found = std::lower_bound(list_of_f + 1, list_of_f + L + 1,
                                     (f[to[e]] * TAG + 1) % MOD) -
                    list_of_f;
        g[to[e]] =
            (prefix[L] +
             (prefix[found - 1] - prefix[found] + MOD) * powBAS[L - found] +
             TAG) %
            MOD;
      }
  }
}
std::map<long long, int> map;
int diff[100001], ans;
void add(long long x) {
  if (!map[x]++) ans++;
}
void del(long long x) {
  if (!--map[x]) ans--;
}
void DFS() {
  for (int i = 2; i <= N; i++) add(f[i]);
  diff[1] = ans;
  int D = 1;
  q[1] = 1;
  ue[1] = head[1];
  while (D) {
    if (ue[D] && to[ue[D]] == fa[q[D]]) ue[D] = next[ue[D]];
    if (ue[D]) {
      int To = to[ue[D]];
      ue[D] = next[ue[D]];
      del(f[To]);
      add(g[To]);
      diff[To] = ans;
      q[++D] = To;
      ue[D] = head[To];
    } else {
      add(f[q[D]]);
      del(g[q[D]]);
      D--;
    }
  }
}
int main() {
  scanf("%d", &N);
  powBAS[0] = 1;
  for (int i = 1; i <= N; i++) powBAS[i] = powBAS[i - 1] * BAS % MOD;
  for (int i = 1, u, v; i < N; i++) {
    scanf("%d%d", &u, &v);
    next[++E] = head[u], to[E] = v, head[u] = E;
    next[++E] = head[v], to[E] = u, head[v] = E;
  }
  BFS();
  DFS();
  printf("%ld\n", std::max_element(diff + 1, diff + N + 1) - diff);
  return 0;
}
