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;
vector<int> edge[100010];
int n, siz[100010], tot, ans, anss;
map<long long, int> ex;
long long hab[100010], haa[100010], cf[100010], ny[100010];
int cmp(int x, int y) { return hab[x] < hab[y]; }
void dfs1(int x, int y) {
  hab[x] = 1000000007;
  for (int i = 0; i < edge[x].size(); i++)
    if (edge[x][i] != y) dfs1(edge[x][i], x);
  sort(edge[x].begin(), edge[x].end(), cmp);
  for (int i = 0; i < edge[x].size(); i++) {
    hab[x] = (hab[x] + hab[edge[x][i]] * cf[siz[x]]) % 1000000007;
    siz[x] += siz[edge[x][i]];
  }
  hab[x] = (hab[x] + cf[siz[x]] * (siz[x] + 1)) % 1000000007;
  tot += (ex[hab[x]] == 0);
  ex[hab[x]]++;
  siz[x]++;
  return;
}
void dfs2(int x, int y, long long z) {
  if (z != 1000000007) {
    tot += (ex[z] == 0);
    ex[z]++;
  }
  ex[hab[x]]--;
  tot -= (ex[hab[x]] == 0);
  int bo = 0, now = 0;
  for (int i = 0; i < edge[x].size(); i++)
    if (edge[x][i] != y) {
      if (!bo && z < hab[edge[x][i]]) {
        bo = 1;
        haa[x] = (haa[x] + z * cf[now]) % 1000000007;
        now += (n - siz[x]);
      }
      haa[x] = (haa[x] + hab[edge[x][i]] * cf[now]) % 1000000007;
      now += siz[edge[x][i]];
    }
  if (!bo) {
    bo = 1;
    haa[x] = (haa[x] + z * cf[now]) % 1000000007;
    now += (n - siz[x]);
  }
  haa[x] = (haa[x] + n * cf[now]) % 1000000007;
  now++;
  tot += (ex[haa[x]] == 0);
  ex[haa[x]]++;
  if (tot > ans) {
    ans = tot;
    anss = x;
  }
  long long num = (haa[x] - n * cf[n - 1]) % 1000000007, tmp = 0;
  now = bo = 0;
  for (int i = 0; i < edge[x].size(); i++)
    if (edge[x][i] != y) {
      ex[haa[x]]--;
      tot -= (ex[haa[x]] == 0);
      if (!bo && z < hab[edge[x][i]]) {
        num = (num - z * cf[now]) % 1000000007;
        tmp = (tmp + z * cf[now]) % 1000000007;
        now += n - siz[x];
        bo = 1;
      }
      num = (num - hab[edge[x][i]] * cf[now]) % 1000000007;
      dfs2(edge[x][i], x,
           ((num * ny[siz[edge[x][i]]] + tmp +
             (n - siz[edge[x][i]]) * cf[n - siz[edge[x][i]] - 1]) %
                1000000007 +
            1000000007) %
               1000000007);
      tmp = (tmp + hab[edge[x][i]] * cf[now]) % 1000000007;
      now += siz[edge[x][i]];
      tot += (ex[haa[x]] == 0);
      ex[haa[x]]++;
    }
  if (z != 1000000007) {
    ex[z]--;
    tot -= (ex[z] == 0);
  }
  tot += (ex[hab[x]] == 0);
  ex[hab[x]]++;
  ex[haa[x]]--;
  tot -= (ex[haa[x]] == 0);
}
int main() {
  scanf("%d", &n);
  cf[0] = 1;
  ny[0] = 1;
  for (int i = 1; i <= n; i++) cf[i] = (cf[i - 1] * 100003) % 1000000007;
  for (int i = 1; i <= n; i++) ny[i] = (ny[i - 1] * 443036712) % 1000000007;
  for (int i = 1; i < n; i++) {
    int o, p;
    scanf("%d%d", &o, &p);
    edge[o].push_back(p);
    edge[p].push_back(o);
  }
  dfs1(1, 0);
  dfs2(1, 0, 1000000007);
  printf("%d\n", anss);
}
