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;
template <typename T>
void get_int(T &x) {
  char t = getchar();
  bool neg = false;
  x = 0;
  for (; (t > '9' || t < '0') && t != '-'; t = getchar())
    ;
  if (t == '-') neg = true, t = getchar();
  for (; t <= '9' && t >= '0'; t = getchar()) x = x * 10 + t - '0';
  if (neg) x = -x;
}
template <typename T>
void print_int(T x) {
  if (x < 0) putchar('-'), x = -x;
  short a[20] = {}, sz = 0;
  while (x > 0) a[sz++] = x % 10, x /= 10;
  if (sz == 0) putchar('0');
  for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);
}
const int inf = 0x3f3f3f3f;
const long long Linf = 1ll << 61;
const double pi = acos(-1.0);
const int maxn = 100111;
const unsigned long long base = 1000000009, b2 = 998244353;
vector<int> g[maxn];
unsigned long long power[maxn], hs[maxn], down[maxn];
map<unsigned long long, int> cur;
int curans;
void add(unsigned long long x) {
  if ((cur[x]++) == 0) curans++;
}
void era(unsigned long long x) {
  if ((--cur[x]) == 0) curans--;
}
int n, f[maxn], sz[maxn], ans[maxn];
void dfs(int x, int f) {
  sz[x] = 1;
  vector<unsigned long long> hsy;
  for (int i = 0; i < (int)g[x].size(); i++)
    if (g[x][i] != f) {
      dfs(g[x][i], x);
      hsy.push_back(hs[g[x][i]]);
      sz[x] += sz[g[x][i]];
    }
  sort(hsy.begin(), hsy.end());
  for (int i = 0; i < (int)hsy.size(); i++) hs[x] = hs[x] * base + hsy[i];
  hs[x] = hs[x] * base * b2 + sz[x];
  add(hs[x]);
}
void dfs2(int x, int f) {
  era(hs[x]);
  ans[x] = curans;
  vector<pair<unsigned long long, int> > hsy;
  vector<unsigned long long> suf;
  for (int i = 0; i < (int)g[x].size(); i++)
    if (g[x][i] != f)
      hsy.push_back(make_pair(hs[g[x][i]], g[x][i]));
    else
      hsy.push_back(make_pair(down[x], 0));
  sort(hsy.begin(), hsy.end());
  suf.resize(hsy.size() + 1);
  suf[hsy.size()] = 0;
  for (int i = hsy.size() - 1; i >= 0; i--)
    suf[i] = suf[i + 1] + power[(int)hsy.size() - i - 1] * hsy[i].first;
  unsigned long long cur = 0;
  for (int i = 0; i < (int)hsy.size(); i++) {
    if (hsy[i].second) {
      down[hsy[i].second] =
          (cur * power[(int)hsy.size() - i - 1] + suf[i + 1]) * base * b2 + n -
          sz[hsy[i].second];
      add(down[hsy[i].second]);
      dfs2(hsy[i].second, x);
      era(down[hsy[i].second]);
    }
    cur = cur * base + hsy[i].first;
  }
  add(hs[x]);
}
int main() {
  power[0] = 1;
  for (int i = 1; i < maxn; i++) power[i] = power[i - 1] * base;
  get_int(n);
  for (int i = 1, u, v; i < n; i++) {
    get_int(u), get_int(v);
    g[u].push_back(v);
    g[v].push_back(u);
  }
  dfs(1, 0);
  dfs2(1, 0);
  printf("%d\n", max_element(ans + 1, ans + n + 1) - ans);
  return 0;
}
