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;
using ll = long long;
using Edge = pair<int, int>;
const ll p = 179;
const ll mod = 1791791791l;
const int maxn = 1e6 + 179;
struct TreeData {
  TreeData(ll h, int s) : hash(h), size(s) {}
  ll hash;
  int size;
  bool operator<(const TreeData& td) const { return hash < td.hash; }
};
int n;
vector<vector<int>> nbrs;
vector<Edge> edges;
map<Edge, ll> hash_of;
void Load() {
  scanf("%d", &n);
  nbrs.resize(n);
  for (int i = 0; i < n - 1; ++i) {
    int a, b;
    scanf("%d%d", &a, &b);
    a--, b--;
    nbrs[a].push_back(b);
    nbrs[b].push_back(a);
    edges.push_back({a, b});
    edges.push_back({b, a});
  }
}
void CollectHashes(int v, int fromv, unordered_map<ll, int>* curhashes) {
  for (int i = 0; i < nbrs[v].size(); ++i) {
    if (nbrs[v][i] != fromv) {
      Edge e(v, nbrs[v][i]);
      ll val = hash_of[e];
      (*curhashes)[val]++;
      CollectHashes(nbrs[v][i], v, curhashes);
    }
  }
}
void EulerTourDFS(int v, int fromv, unordered_map<ll, int>* curhashes, int* ans,
                  int* maxhashes) {
  Edge e(v, fromv);
  Edge ef(fromv, v);
  if (fromv != -1) {
    (*curhashes)[hash_of[ef]]--;
    if ((*curhashes)[hash_of[ef]] == 0) {
      curhashes->erase(hash_of[ef]);
    }
    (*curhashes)[hash_of[e]]++;
  }
  if (curhashes->size() > *maxhashes) {
    *maxhashes = curhashes->size();
    *ans = v;
  }
  for (int i = 0; i < nbrs[v].size(); ++i) {
    if (nbrs[v][i] != fromv) {
      EulerTourDFS(nbrs[v][i], v, curhashes, ans, maxhashes);
    }
  }
  (*curhashes)[hash_of[ef]]++;
  (*curhashes)[hash_of[e]]--;
  if ((*curhashes)[hash_of[e]] == 0) {
    curhashes->erase(hash_of[e]);
  }
}
void Solve() {
  ll ppows[maxn];
  ppows[0] = 1;
  for (int i = 1; i < maxn; ++i) {
    ppows[i] = (ppows[i - 1] * p) % mod;
  }
  queue<Edge> q;
  map<Edge, int> size_of;
  vector<int> out(n, 0);
  for (int i = 0; i < edges.size(); ++i) {
    if (nbrs[edges[i].second].size() == 1) {
      hash_of[edges[i]] = '(' * p + ')';
      size_of[edges[i]] = 1;
      out[edges[i].first]++;
      q.push(edges[i]);
    }
  }
  vector<bool> fulloutcalc(n, false);
  vector<bool> mostoutcalc(n, false);
  while (!q.empty()) {
    Edge e = q.front();
    q.pop();
    int v = e.first;
    if (out[v] == nbrs[v].size() - 1) {
      if (mostoutcalc[v]) continue;
      mostoutcalc[v] = true;
      int u;
      vector<TreeData> known;
      for (int i = 0; i < nbrs[v].size(); ++i) {
        if (hash_of.count({v, nbrs[v][i]}) == 0) {
          u = nbrs[v][i];
          continue;
        }
        known.push_back({hash_of[{v, nbrs[v][i]}], size_of[{v, nbrs[v][i]}]});
      }
      sort((known).begin(), (known).end());
      Edge ne = {u, v};
      int size = 1;
      hash_of[ne] = '(';
      for (int i = 0; i < known.size(); ++i) {
        hash_of[ne] = (hash_of[ne] * ppows[2 * known[i].size]) % mod;
        hash_of[ne] = (hash_of[ne] + known[i].hash) % mod;
        size += known[i].size;
      }
      hash_of[ne] = (hash_of[ne] * p + ')') % mod;
      size_of[ne] = size;
      out[u]++;
      q.push(ne);
      continue;
    }
    if (out[v] != nbrs[v].size()) {
      continue;
    }
    if (fulloutcalc[v]) continue;
    fulloutcalc[v] = true;
    vector<int> sorted_indices(nbrs[v].size(), 0);
    iota((sorted_indices).begin(), (sorted_indices).end(), 0);
    sort((sorted_indices).begin(), (sorted_indices).end(),
         [v](const ll a, const ll b) {
           Edge e1(v, nbrs[v][a]);
           Edge e2(v, nbrs[v][b]);
           return hash_of[e1] < hash_of[e2];
         });
    vector<ll> pref(nbrs[v].size(), 0), suf(nbrs[v].size(), 0),
        suf_sz(nbrs[v].size(), 0);
    pref[0] = '(';
    for (int i = 1; i < nbrs[v].size(); ++i) {
      pref[i] = (pref[i - 1] *
                 ppows[2 * size_of[{v, nbrs[v][sorted_indices[i - 1]]}]]) %
                mod;
      pref[i] = (pref[i] + hash_of[{v, nbrs[v][sorted_indices[i - 1]]}]) % mod;
    }
    suf[nbrs[v].size() - 1] = ')';
    suf_sz[nbrs[v].size() - 1] = 0;
    for (int i = nbrs[v].size() - 2; i >= 0; --i) {
      suf[i] = (suf[i + 1] + hash_of[{v, nbrs[v][sorted_indices[i + 1]]}] *
                                 ppows[2 * suf_sz[i + 1] + 1]) %
               mod;
      Edge e(v, nbrs[v][sorted_indices[i + 1]]);
      suf_sz[i] = suf_sz[i + 1] + size_of[e];
    }
    for (int i = 0; i < nbrs[v].size(); ++i) {
      Edge e(nbrs[v][sorted_indices[i]], v);
      Edge ef(v, nbrs[v][sorted_indices[i]]);
      if (hash_of[e] == 0) {
        hash_of[e] = (pref[i] * ppows[2 * suf_sz[i] + 1]) % mod;
        hash_of[e] = (hash_of[e] + suf[i]) % mod;
        size_of[e] = n - size_of[ef];
        out[nbrs[v][sorted_indices[i]]]++;
        q.push({nbrs[v][sorted_indices[i]], v});
      }
    }
  }
  unordered_map<ll, int> curhashes;
  CollectHashes(0, -1, &curhashes);
  int ans = curhashes.size(), maxhashes = 0;
  EulerTourDFS(0, -1, &curhashes, &ans, &maxhashes);
  printf("%d\n", ans + 1);
}
int main() {
  Load();
  Solve();
  return 0;
}
