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 N = 100100;
const long long MOD = 100030001, H = 47;
map<int, long long> d[N];
vector<int> adj[N];
set<pair<long long, int> > s;
vector<pair<int, pair<long long, int> > > nei[N];
long long r[N], l[N], num[N], ch[N], h[3 * N], n, sz, ans, o = 10, c = 11;
void add(int ind, int val) {
  auto it = s.lower_bound({ind, val});
  if (it == s.end() || it->first != ind)
    s.insert({ind, val});
  else {
    if (it->second + val != 0) s.insert({ind, it->second + val});
    s.erase(it);
  }
  return;
}
void f(int v, int u) {
  add(d[v][v], -1);
  add(d[u][u], 1);
  add(d[v][u], 1);
  add(d[u][v], -1);
  return;
}
void DFS1(int v, int par = 0) {
  for (int u : adj[v]) {
    if (u != par) {
      DFS1(u, v);
      ch[v] += ch[u];
      nei[v].push_back({d[u][v], {ch[u], u}});
    }
  }
  ch[v]++;
  long long ans = o;
  sort(nei[v].begin(), nei[v].end());
  for (auto u : nei[v]) {
    ans = ans * h[2 * u.second.first] % MOD;
    ans = (ans + u.first) % MOD;
  }
  d[v][par] = (ans * H + c) % MOD;
  return;
}
void DFS2(int v, int par = 0) {
  nei[v].clear();
  for (int u : adj[v]) {
    nei[v].push_back({d[u][v], {ch[u], u}});
    if (u == par) nei[v].back().second.first = n - ch[v];
  }
  sort(nei[v].begin(), nei[v].end());
  l[0] = o, r[nei[v].size() + 1] = c, num[nei[v].size() + 1] = 1;
  for (int i = 1; i <= nei[v].size(); i++) {
    auto u = nei[v][i - 1];
    l[i] = (l[i - 1] * h[u.second.first * 2] + d[u.second.second][v]) % MOD;
  }
  for (int i = nei[v].size(); i > 0; i--) {
    auto u = nei[v][i - 1];
    num[i] = num[i + 1] + u.second.first * 2;
    r[i] = (r[i + 1] + d[u.second.second][v] * h[num[i + 1]]) % MOD;
  }
  for (int i = 0; i < nei[v].size(); i++) {
    d[v][nei[v][i].second.second] = (l[i] * h[num[i + 2]] + r[i + 2]) % MOD;
  }
  for (int u : adj[v])
    if (u != par) DFS2(u, v);
  add(d[v][par], 1);
  return;
}
void DFS3(int v, int par = 0) {
  if (s.size() > sz) {
    ans = v;
    sz = s.size();
  }
  for (int u : adj[v]) {
    if (u != par) {
      f(v, u);
      DFS3(u, v);
    }
  }
  f(v, par);
  return;
}
int main() {
  ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int u, v;
  cin >> n;
  h[0] = 1;
  for (int i = 0; i <= n * 2 + 10; i++) h[i + 1] = h[i] * H % MOD;
  for (int i = 1; i < n; i++) {
    cin >> u >> v;
    adj[--u].push_back(--v);
    adj[v].push_back(u);
  }
  if (n == 1) {
    cout << 1 << endl;
    return 0;
  }
  DFS1(0);
  DFS2(0);
  DFS3(0);
  cout << ans + 1 << endl;
  return 0;
}
