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 MAXN = 100005;
template <typename T>
inline void read(T &AKNOI) {
  T x = 0, flag = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') flag = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  AKNOI = flag * x;
}
int n, id;
vector<int> e[MAXN];
unsigned long long hsh[MAXN << 1];
map<unsigned long long, int> mp;
int sub[MAXN], cnt[MAXN << 1], sum, ans, ansp;
inline int Hash(unsigned long long x) {
  if (mp.count(x)) return mp[x];
  return mp[x] = ++id;
}
inline void Add(int x) { sum += (++cnt[x] == 1); }
inline void Del(int x) { sum -= (--cnt[x] == 0); }
void DFS1(int u, int fa) {
  unsigned long long cur = 0;
  for (auto v : e[u]) {
    if (v == fa) continue;
    DFS1(v, u);
    cur += hsh[sub[v]];
  }
  sub[u] = Hash(cur);
  Add(sub[u]);
}
void DFS2(int u, int fa, int fhs) {
  Del(sub[u]);
  if (sum + 1 > ans) {
    ans = sum + 1;
    ansp = u;
  }
  unsigned long long cur = 0;
  for (auto v : e[u]) {
    if (v == fa) continue;
    cur += hsh[sub[v]];
  }
  cur += hsh[fhs];
  for (auto v : e[u]) {
    if (v == fa) continue;
    int tmp = Hash(cur - hsh[sub[v]]);
    Add(tmp);
    DFS2(v, u, tmp);
    Del(tmp);
  }
  Add(sub[u]);
}
void init() {
  read(n);
  for (int i = 1, u, v; i < n; ++i) {
    read(u);
    read(v);
    e[u].push_back(v);
    e[v].push_back(u);
  }
  srand((unsigned)time(NULL));
  for (int i = 1; i <= n + n; ++i) {
    unsigned long long cur = (unsigned long long)rand() * 998244353 * 998244353;
    cur ^= (cur << 23) ^ (cur >> 29);
    cur += (unsigned long long)rand() * 1000000007;
    hsh[i] = cur;
  }
}
void solve() {
  DFS1(1, 0);
  ans = sum;
  ansp = 1;
  DFS2(1, 0, 0);
  printf("%d\n", ansp);
}
int main() {
  init();
  solve();
  return 0;
}
