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 read(T& x) {
  static char c;
  static int f;
  for (c = getchar(), f = 1; c < '0' || c > '9'; c = getchar())
    if (c == '-') f = -f;
  for (x = 0; c >= '0' && c <= '9'; c = getchar()) x = x * 10 + (c & 15);
  x *= f;
}
template <typename T>
void write(T x) {
  static char q[65];
  int cnt = 0;
  if (x < 0) putchar('-'), x = -x;
  q[++cnt] = x % 10, x /= 10;
  while (x) q[++cnt] = x % 10, x /= 10;
  while (cnt) putchar(q[cnt--] + '0');
}
const int mod = 1000000007, maxn = 100005;
int mo(const int x) { return x >= mod ? x - mod : x; }
int power(int a, int x) {
  int re = 1;
  while (x) {
    if (x & 1) re = 1ll * re * a % mod;
    a = 1ll * a * a % mod, x >>= 1;
  }
  return re;
}
struct Edge {
  int v, nt;
  Edge(int v = 0, int nt = 0) : v(v), nt(nt) {}
} e[maxn * 2];
int hd[maxn], num;
void qwq(int u, int v) { e[++num] = Edge(v, hd[u]), hd[u] = num; }
int sz[maxn], ha[maxn], pri[maxn];
void dfs0(int u, int fa) {
  sz[u] = 1;
  ha[u] = 0;
  for (int i = hd[u]; i; i = e[i].nt) {
    int v = e[i].v;
    if (v == fa) continue;
    dfs0(v, u);
    sz[u] += sz[v];
    ha[u] = mo(ha[u] + ha[v]);
  }
  ha[u] = mo(1ll * ha[u] * sz[u] % mod + pri[sz[u]]);
}
int I[maxn][4];
void dfs1(int u, int fa) {
  int hu = ha[u], su = sz[u];
  for (int i = hd[u]; i; i = e[i].nt) {
    int v = e[i].v;
    if (v == fa) continue;
    I[v][0] = ha[u];
    I[v][1] = ha[v];
    ha[u] =
        mo(mod - ha[v] +
           1ll * mo(mod - pri[sz[u]] + ha[u]) * power(sz[u], mod - 2) % mod);
    sz[u] -= sz[v];
    ha[u] = mo(1ll * ha[u] * sz[u] % mod + pri[sz[u]]);
    ha[v] = 1ll * mo(mod - pri[sz[v]] + ha[v]) * power(sz[v], mod - 2) % mod;
    sz[v] += sz[u];
    ha[v] = mo(1ll * mo(ha[v] + ha[u]) * sz[v] % mod + pri[sz[v]]);
    I[v][2] = ha[u];
    I[v][3] = ha[v];
    dfs1(v, u);
    ha[u] = hu, sz[u] = su;
  }
}
int ox[maxn * 5], sum[maxn * 5], cnt;
int no, mx, ans;
void add(int pos) { no += !(sum[pos]++); }
void del(int pos) { no -= !(--sum[pos]); }
void dfs2(int u, int fa) {
  if (fa) {
    del(lower_bound(ox, ox + cnt, I[u][0]) - ox);
    del(lower_bound(ox, ox + cnt, I[u][1]) - ox);
    add(lower_bound(ox, ox + cnt, I[u][2]) - ox);
    add(lower_bound(ox, ox + cnt, I[u][3]) - ox);
  }
  if (no > mx) mx = no, ans = u;
  for (int i = hd[u]; i; i = e[i].nt) {
    int v = e[i].v;
    if (v == fa) continue;
    dfs2(v, u);
  }
  if (fa) {
    add(lower_bound(ox, ox + cnt, I[u][0]) - ox);
    add(lower_bound(ox, ox + cnt, I[u][1]) - ox);
    del(lower_bound(ox, ox + cnt, I[u][2]) - ox);
    del(lower_bound(ox, ox + cnt, I[u][3]) - ox);
  }
}
int cp[maxn];
int main() {
  int n;
  read(n);
  for (int i = 1; i <= n; ++i) pri[i] = 1ll * i * i % mod;
  for (int i = 1; i < n; ++i) {
    int u, v;
    read(u), read(v);
    qwq(u, v);
    qwq(v, u);
  }
  dfs0(1, 0);
  for (int i = 1; i <= n; ++i) ox[cnt++] = cp[i] = ha[i];
  dfs1(1, 0);
  for (int i = 1; i <= n; ++i)
    for (int t = 0; t < 4; ++t) ox[cnt++] = I[i][t];
  sort(ox, ox + cnt);
  cnt = unique(ox, ox + cnt) - ox;
  for (int i = 1; i <= n; ++i) add(lower_bound(ox, ox + cnt, cp[i]) - ox);
  dfs2(1, 0);
  write(ans), putchar('\n');
  return 0;
}
