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;
inline long long rd() {
  long long x = 0;
  int ch = getchar(), f = 1;
  while (!isdigit(ch) && (ch != '-') && (ch != EOF)) ch = getchar();
  if (ch == '-') {
    f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = (x << 1) + (x << 3) + ch - '0';
    ch = getchar();
  }
  return x * f;
}
inline void rt(long long x) {
  if (x < 0) putchar('-'), x = -x;
  if (x >= 10)
    rt(x / 10), putchar(x % 10 + '0');
  else
    putchar(x + '0');
}
const int maxn = 100005;
int to[maxn << 1], nx[maxn << 1], hd[maxn], cnt;
void addedge(int u, int v) {
  to[cnt] = v;
  nx[cnt] = hd[u];
  hd[u] = cnt++;
}
int HD[1000007], val[maxn << 1], NX[maxn << 1], num[maxn << 1], CNT;
int n, hs[maxn];
int nv = 0;
void add(int x) {
  int u = x % 1000007;
  for (int i = HD[u]; ~i; i = NX[i]) {
    int v = val[i];
    if (v == x) {
      num[i]++;
      if (num[i] == 1) nv++;
      return;
    }
  }
  val[CNT] = x;
  num[CNT] = 1;
  NX[CNT] = HD[u];
  HD[u] = CNT++;
  nv++;
}
void del(int x) {
  int u = x % 1000007;
  for (int i = HD[u]; ~i; i = NX[i]) {
    int v = val[i];
    if (v == x) {
      num[i]--;
      if (!num[i]) nv--;
      return;
    }
  }
}
int ans = 0, mx = 0;
void dfs(int u, int fa) {
  hs[u] = 1;
  for (int i = hd[u]; ~i; i = nx[i]) {
    int v = to[i];
    if (v == fa) continue;
    dfs(v, u);
    hs[u] = (hs[u] + 3ll * hs[v] * hs[v] % 1000000007 * hs[v]) % 1000000007;
  }
  add(hs[u]);
}
void findans(int u, int fa) {
  if (nv > mx) mx = nv, ans = u;
  for (int i = hd[u]; ~i; i = nx[i]) {
    int v = to[i];
    if (v == fa) continue;
    int t1 = hs[u], t2 = hs[v];
    del(hs[u]), del(hs[v]);
    hs[u] = (hs[u] + 1000000007 -
             3ll * hs[v] * hs[v] % 1000000007 * hs[v] % 1000000007) %
            1000000007;
    hs[v] = (hs[v] + 3ll * hs[u] * hs[u] % 1000000007 * hs[u]) % 1000000007;
    add(hs[u]), add(hs[v]);
    findans(v, u);
    del(hs[u]), del(hs[v]);
    hs[u] = t1, hs[v] = t2;
    add(hs[u]), add(hs[v]);
  }
}
int main() {
  n = rd();
  memset(hd, -1, sizeof hd);
  for (int i = 1; i <= (int)n - 1; i++) {
    int u = rd(), v = rd();
    addedge(u, v), addedge(v, u);
  }
  memset(HD, -1, sizeof HD);
  dfs(1, 0);
  findans(1, 0);
  rt(ans);
}
