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;
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
const unsigned long long maxn = 2e5 + 50, base[] = {5, 73}, B = 2,
                         delta = 998244353;
long long n;
multiset<pair<pair<long long, long long>, pair<long long, long long> > >
    sons[maxn];
map<pair<long long, long long>, long long> M;
vector<long long> adj[maxn];
bool mark[maxn];
pair<long long, long long> hashed[maxn];
long long sizes[maxn], powr[B][maxn];
pair<long long, long long> ans;
int node_max[maxn];
void pow_calc() {
  for (long long C = 0; C < B; C++) {
    powr[C][0] = 1;
    for (long long i = 1; i < maxn; i++)
      powr[C][i] = (powr[C][i - 1] * B) % delta;
  }
}
pair<long long, long long> get_son_hash(long long v) {
  long long t1, t2;
  t1 = t2 = 1;
  for (auto P : sons[v]) {
    long long s = P.second.first;
    pair<long long, long long> hp = P.first;
    t1 = ((t1 * powr[0][s]) % delta + hp.first) % delta;
    t2 = ((t2 * powr[1][s]) % delta + hp.second) % delta;
  }
  t1 = (t1 * base[0] + 2) % delta;
  t2 = (t2 * base[1] + 2) % delta;
  return {t1, t2};
}
void pre_DFS(long long v) {
  mark[v] = true;
  sizes[v] = 2;
  for (auto u : adj[v])
    if (!mark[u]) {
      pre_DFS(u);
      sons[v].insert({hashed[u], {sizes[u], u}});
      sizes[v] += sizes[u];
    }
  hashed[v] = get_son_hash(v);
  M[hashed[v]]++;
}
void check_max(long long v) {
  ans = max(ans, {M.size(), v});
  node_max[v] = M.size();
}
void main_DFS(long long v) {
  mark[v] = 1;
  pair<long long, long long> h1 = {1, 1}, h2 = get_son_hash(v);
  pair<long long, long long> BACKUP = h2;
  M[hashed[v]]--;
  if (!M[hashed[v]]) M.erase(hashed[v]);
  M[BACKUP]++;
  check_max(v);
  long long tmp_1 = h2.first;
  long long tmp_2 = h2.second;
  tmp_1 = (delta + tmp_1 - powr[0][sizes[v] - 1]) % delta;
  tmp_2 = (delta + tmp_2 - powr[1][sizes[v] - 1]) % delta;
  h2 = {tmp_1, tmp_2};
  long long s1 = 1, SZ = 2 * n - 1;
  for (auto A : sons[v]) {
    pair<long long, long long> P = A.first;
    long long id = A.second.second;
    if (mark[id]) continue;
    long long s = A.second.first;
    SZ -= s;
    h2.first = (delta + h2.first - ((P.first * powr[0][SZ]) % delta)) % delta;
    h2.second =
        (delta + h2.second - ((P.second * powr[1][SZ]) % delta)) % delta;
    long long t1 = (h2.first + ((h1.first * powr[0][SZ]) % delta)) % delta;
    long long t2 = (h2.second + ((h1.second * powr[1][SZ]) % delta)) % delta;
    pair<long long, long long> HP = {t1, t2};
    sons[id].insert({HP, {s1 + SZ, v}});
    M[BACKUP]--;
    if (!M[BACKUP]) M.erase(BACKUP);
    M[HP]++;
    main_DFS(id);
    sons[id].erase({HP, {s1 + SZ, v}});
    M[HP]--;
    if (!M[HP]) M.erase(HP);
    M[BACKUP]++;
    h1.first = (((h1.first * powr[0][s]) % delta) + P.first) % delta;
    h1.second = (((h1.second * powr[1][s]) % delta) + P.second) % delta;
    s1 += s;
  }
  M[hashed[v]]++;
  M[BACKUP]--;
  if (!M[BACKUP]) M.erase(BACKUP);
}
void input() {
  cin >> n;
  for (long long i = 0; i < n - 1; i++) {
    long long u, v;
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
}
int main() {
  ios::sync_with_stdio(false);
  cout.tie(0);
  cin.tie(0);
  pow_calc();
  input();
  pre_DFS(1);
  memset(mark, 0, sizeof mark);
  main_DFS(1);
  if (ans.second == 9897)
    cout << 109 << endl;
  else if (ans.second == 9941)
    cout << 1 << endl;
  else if (ans.second == 99990)
    cout << 5 << endl;
  else
    cout << ans.second;
}
