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;
const int iinf = 1e9 + 7;
const long long linf = 1ll << 60;
const double dinf = 1e10;
template <typename T>
inline void scf(T &x) {
  bool f = 0;
  x = 0;
  char c = getchar();
  while ((c < '0' || c > '9') && c != '-') c = getchar();
  if (c == '-') {
    f = 1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = x * 10 + c - '0';
    c = getchar();
  }
  if (f) x = -x;
  return;
}
template <typename T1, typename T2>
void scf(T1 &x, T2 &y) {
  scf(x);
  return scf(y);
}
template <typename T1, typename T2, typename T3>
void scf(T1 &x, T2 &y, T3 &z) {
  scf(x);
  scf(y);
  return scf(z);
}
template <typename T1, typename T2, typename T3, typename T4>
void scf(T1 &x, T2 &y, T3 &z, T4 &w) {
  scf(x);
  scf(y);
  scf(z);
  return scf(w);
}
const int N = 1e5 + 100;
using u64 = unsigned long long;
int n, tot, ans, cur, rem;
vector<int> g[N];
u64 seed[N + N], h1[N], h2[N], up[N];
int r1[N], r2[N], cnt[N + N];
map<u64, int> M;
void dfs1(int u = 1, int f = 0) {
  h1[u] = seed[0];
  for (int v : g[u])
    if (v != f) {
      dfs1(v, u);
      h1[u] += seed[r1[v]];
    }
  if (M.find(h1[u]) == M.end()) M[h1[u]] = (++tot);
  r1[u] = M[h1[u]];
  return;
}
void dfs2(int u = 1, int f = 0) {
  if (f) h2[u] = seed[r2[u]];
  h2[u] += h1[u];
  for (int v : g[u])
    if (v != f) {
      up[v] = h2[u] - seed[r1[v]];
      if (M.find(up[v]) == M.end()) M[up[v]] = (++tot);
      r2[v] = M[up[v]];
      dfs2(v, u);
    }
  return;
}
void dfs(int u = 1, int f = 0) {
  cnt[r1[u]]--;
  if (!cnt[r1[u]]) cur--;
  if (!cnt[r2[u]]) cur++;
  cnt[r2[u]]++;
  if (cur > ans) ans = cur, rem = u;
  for (int v : g[u])
    if (v != f) dfs(v, u);
  if (!cnt[r1[u]]) cur++;
  cnt[r1[u]]++;
  cnt[r2[u]]--;
  if (!cnt[r2[u]]) cur--;
  return;
}
int main() {
  scf(n);
  for (int i = 0; i < (n + n + 10); i++)
    seed[i] = ((u64)rand() << 40) | ((u64)rand() << 20) | (u64)rand();
  for (int i = 0; i < (n - 1); i++) {
    int u, v;
    scf(u, v);
    g[u].push_back(v);
    g[v].push_back(u);
  }
  dfs1();
  dfs2();
  for (int i = (1); i <= (n); i++) {
    if (!cnt[r1[i]]) cur++;
    cnt[r1[i]]++;
  }
  dfs();
  printf("%d\n", rem);
  return 0;
}
