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 long long p = 179;
const long long mod = 1791791791l;
const int maxn = 1e6 + 179;
vector<vector<int> > tree;
vector<vector<long long> > frw_hash;
vector<vector<long long> > rev_hash;
vector<int> num;
void get_all(int v, int par, unordered_map<long long, int>& ums) {
  int i = 0;
  for (int u : tree[v]) {
    if (u != par) {
      ums[frw_hash[v][i]]++;
      get_all(u, v, ums);
    }
    i++;
  }
}
void dfs(int v, int par, unordered_map<long long, int>& ums) {
  num[v] = ums.size();
  int i = 0;
  for (int u : tree[v]) {
    if (u != par) {
      ums[frw_hash[v][i]]--;
      if (ums[frw_hash[v][i]] == 0) ums.erase(frw_hash[v][i]);
      ums[rev_hash[v][i]]++;
      dfs(u, v, ums);
      ums[rev_hash[v][i]]--;
      if (ums[rev_hash[v][i]] == 0) ums.erase(rev_hash[v][i]);
      ums[frw_hash[v][i]]++;
    }
    i++;
  }
}
int main() {
  long long ppows[maxn];
  ppows[0] = 1;
  for (int i = 1; i < maxn; ++i) ppows[i] = (ppows[i - 1] * p) % mod;
  int n;
  cin >> n;
  tree.resize(n);
  vector<pair<int, int> > edges;
  for (int i = 0; i < n - 1; ++i) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    tree[u].push_back(v);
    tree[v].push_back(u);
    edges.push_back(make_pair(u, v));
    edges.push_back(make_pair(v, u));
  }
  map<pair<int, int>, int> index;
  for (int i = 0; i < 2 * n - 2; ++i) index[edges[i]] = i;
  vector<int> sz_of(edges.size(), -1), out(n, 0);
  vector<long long> hash_of(edges.size(), -1);
  queue<int> q;
  for (int i = 0; i < n; ++i) {
    if (tree[i].size() == 1) {
      hash_of[index[make_pair(tree[i][0], i)]] = ('(' * p + ')') % mod;
      out[tree[i][0]]++;
      sz_of[index[make_pair(tree[i][0], i)]] = 1;
      q.push(index[make_pair(tree[i][0], i)]);
    }
  }
  vector<bool> fulloutcalc(n, false), mostoutcalc(n, false);
  while (!q.empty()) {
    int a = q.front();
    q.pop();
    int v = edges[a].first;
    if (out[v] == tree[v].size() - 1) {
      if (mostoutcalc[v]) continue;
      mostoutcalc[v] = true;
      int u = -1;
      vector<long long> known_outer_hashes;
      vector<int> known_subtree_sizes;
      for (int w : tree[v]) {
        if (hash_of[index[make_pair(v, w)]] == -1)
          u = w;
        else {
          known_outer_hashes.push_back(hash_of[index[make_pair(v, w)]]);
          known_subtree_sizes.push_back(sz_of[index[make_pair(v, w)]]);
        }
      }
      vector<int> ind(known_outer_hashes.size());
      iota(ind.begin(), ind.end(), 0);
      sort(ind.begin(), ind.end(), [&](const int& i, const int& j) -> bool {
        return known_outer_hashes[i] < known_outer_hashes[j];
      });
      vector<int> szs;
      vector<long long> sorted_outer_hashes;
      for (int i = 0; i < known_outer_hashes.size(); ++i) {
        sorted_outer_hashes.push_back(known_outer_hashes[ind[i]]);
        szs.push_back(known_subtree_sizes[ind[i]]);
      }
      int i = index[make_pair(u, v)];
      if (hash_of[i] != -1) {
        continue;
      }
      hash_of[i] = '(';
      sz_of[i] = 1;
      for (int j = 0; j < sorted_outer_hashes.size(); ++j) {
        hash_of[i] = (hash_of[i] * ppows[2 * szs[j]]) % mod;
        hash_of[i] = (hash_of[i] + sorted_outer_hashes[j]) % mod;
        sz_of[i] += szs[j];
      }
      hash_of[i] = (hash_of[i] * p + ')') % mod;
      out[u]++;
      q.push(i);
      continue;
    }
    if (out[v] != tree[v].size()) continue;
    if (fulloutcalc[v]) continue;
    fulloutcalc[v] = true;
    vector<long long> outer_hashes;
    vector<int> outer_subtree_sizes;
    for (int w : tree[v]) {
      outer_hashes.push_back(hash_of[index[make_pair(v, w)]]);
      outer_subtree_sizes.push_back(sz_of[index[make_pair(v, w)]]);
    }
    vector<int> ind(outer_hashes.size());
    iota(ind.begin(), ind.end(), 0);
    sort(ind.begin(), ind.end(), [&](const int& i, const int& j) -> bool {
      return outer_hashes[i] < outer_hashes[j];
    });
    vector<long long> sorted_outer_hashes;
    vector<int> szs;
    for (int i = 0; i < outer_hashes.size(); ++i) {
      sorted_outer_hashes.push_back(outer_hashes[ind[i]]);
      szs.push_back(outer_subtree_sizes[ind[i]]);
    }
    vector<long long> pref_hh(sorted_outer_hashes.size() + 1, 0);
    pref_hh[0] = '(';
    for (int i = 1; i < sorted_outer_hashes.size(); ++i) {
      pref_hh[i] = (pref_hh[i - 1] * ppows[2 * szs[i - 1]] +
                    sorted_outer_hashes[i - 1]) %
                   mod;
    }
    vector<long long> suf_hh(sorted_outer_hashes.size() + 2, 0);
    vector<int> suf_sz(sorted_outer_hashes.size() + 2, 0);
    suf_hh.back() = ')';
    for (int i = sorted_outer_hashes.size(); i > 1; i--) {
      suf_hh[i] = (suf_hh[i + 1] +
                   sorted_outer_hashes[i - 1] * ppows[2 * suf_sz[i + 1] + 1]) %
                  mod;
      suf_sz[i] = suf_sz[i + 1] + szs[i - 1];
    }
    for (int i = 0; i < sorted_outer_hashes.size(); ++i) {
      int u = tree[v][ind[i]];
      if (hash_of[index[make_pair(u, v)]] == -1) {
        sz_of[index[make_pair(u, v)]] = n - sz_of[index[make_pair(v, u)]];
        hash_of[index[make_pair(u, v)]] =
            (pref_hh[i] * ppows[2 * suf_sz[i + 2] + 1] + suf_hh[i + 2]) % mod;
        out[u]++;
        q.push(index[make_pair(u, v)]);
      }
    }
  }
  frw_hash.resize(n);
  rev_hash.resize(n);
  num.resize(n);
  for (int i = 0; i < n; ++i) {
    for (int v : tree[i]) {
      frw_hash[i].push_back(hash_of[index[make_pair(i, v)]]);
      rev_hash[i].push_back(hash_of[index[make_pair(v, i)]]);
    }
  }
  unordered_map<long long, int> ump;
  get_all(0, -1, ump);
  dfs(0, -1, ump);
  cout << distance(num.begin(), max_element(num.begin(), num.end())) + 1
       << endl;
  return 0;
}
