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>
std::mt19937 rd(time(0));
const int MAXN = 100010;
const int mod = 1004535809;
void reduce(int& x) { x += x >> 31 & mod; }
int mul(int a, int b) { return (long long)a * b % mod; }
int pow(int a, int b, int res = 1) {
  for (; b; b >>= 1, a = mul(a, a))
    if (b & 1) res = mul(res, a);
  return res;
}
int func[MAXN], sz[MAXN];
int f[MAXN], n;
int head[MAXN], nxt[MAXN << 1], to[MAXN << 1], tot;
void adde(int b, int e) {
  nxt[++tot] = head[b];
  to[head[b] = tot] = e;
  nxt[++tot] = head[e];
  to[head[e] = tot] = b;
}
inline int tr(int x, int s) { return (long long)func[s] * x % mod; }
std::unordered_map<int, int> M;
int ans, rt, rtv = -1;
void add(int x) { ans += ++M[x] == 1; }
void dec(int x) { ans -= --M[x] == 0; }
void dfs(int u, int fa = 0) {
  sz[u] = f[u] = 1;
  for (int i = head[u]; i; i = nxt[i])
    if (to[i] != fa) {
      dfs(to[i], u), sz[u] += sz[to[i]];
      reduce(f[u] += tr(f[to[i]], sz[to[i]]) - mod);
    }
  add(f[u]);
}
void dfs2(int u, int up = 0, int fa = 0) {
  int dup = tr(up, n - sz[u]);
  int full = (f[u] + dup) % mod;
  if (fa) add(up);
  add(full), dec(f[u]);
  if (ans > rtv) rtv = ans, rt = u;
  dec(full);
  for (int i = head[u]; i; i = nxt[i])
    if (to[i] != fa) {
      int t = ((long long)dup + f[u] - tr(f[to[i]], sz[to[i]]) + mod) % mod;
      dfs2(to[i], t, u);
    }
  add(f[u]);
  if (fa) dec(up);
}
int main() {
  std::ios_base::sync_with_stdio(false), std::cin.tie(0);
  std::cin >> n;
  for (int i = 1, b, e; i < n; ++i) std::cin >> b >> e, adde(b, e);
  for (int i = 1; i <= n; ++i) func[i] = rd() % mod;
  dfs(1);
  dfs2(1);
  std::cout << rt << std::endl;
  return 0;
}
