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 = (1 << 20);
const int64_t mod = (int64_t)1e9 + 9;
const int64_t base = (int64_t)1e5 + 42;
const int64_t base1 = (int64_t)1e5 + 1719;
const int64_t mod1 = (int64_t)1e9 + 7;
int64_t pw[MAXN], pw1[MAXN];
struct implicit_treap {
  struct node {
    int sz, prior;
    int64_t val, hsh, hsh1;
    node *l, *r;
    node() {
      sz = 0;
      val = 0;
      hsh1 = 0;
      hsh = 0;
      prior = 0;
      l = nullptr;
      r = nullptr;
    }
    node(int64_t _val) {
      val = _val;
      hsh1 = val;
      hsh = val;
      sz = 1;
      prior = rand();
      l = nullptr;
      r = nullptr;
    }
  };
  typedef node *pnode;
  int size(pnode v) { return v ? v->sz : 0; }
  void update_size(pnode &v) {
    if (v) v->sz = size(v->l) + size(v->r) + 1;
  }
  void reset(pnode &v) {
    if (v) v->hsh1 = v->val, v->hsh = v->val;
  }
  void combine(pnode &v, pnode l, pnode r) {
    if (!l) {
      v = r;
      return;
    }
    if (!r) {
      v = l;
      return;
    }
    v->hsh = (l->hsh * pw[r->sz] + r->hsh) % mod;
    v->hsh1 = (l->hsh1 * pw1[r->sz] + r->hsh1) % mod1;
  }
  void operation(pnode &v) {
    if (!v) return;
    reset(v);
    combine(v, v->l, v);
    combine(v, v, v->r);
  }
  void merge(pnode &t, pnode l, pnode r) {
    if (!l) {
      t = r;
      return;
    }
    if (!r) {
      t = l;
      return;
    }
    if (l->prior > r->prior)
      merge(l->r, l->r, r), t = l;
    else
      merge(r->l, l, r->l), t = r;
    update_size(t);
    operation(t);
  }
  void split(pnode t, pnode &l, pnode &r, int k) {
    if (!t) {
      l = nullptr;
      r = nullptr;
      return;
    }
    if (t->val <= k)
      split(t->r, t->r, r, k), l = t;
    else
      split(t->l, l, t->l, k), r = t;
    update_size(t);
    operation(t);
  }
  void split_by_size(pnode t, pnode &l, pnode &r, int k, int add = 0) {
    if (!t) {
      l = nullptr;
      r = nullptr;
      return;
    }
    int idx = add + size(t->l);
    if (idx <= k)
      split_by_size(t->r, t->r, r, k, idx + 1), l = t;
    else
      split_by_size(t->l, l, t->l, k, add), r = t;
    update_size(t);
    operation(t);
  }
  pnode root;
  implicit_treap() { root = nullptr; }
  void insert(int val) {
    if (!root) {
      pnode nw = new node(val);
      root = nw;
      return;
    }
    pnode l, r, nw = new node(val);
    split(root, l, r, val - 1);
    merge(l, l, nw);
    merge(root, l, r);
  }
  void erase(int val) {
    if (!root) {
      pnode nw = new node(val);
      root = nw;
      return;
    }
    pnode l, r, mid;
    split(root, l, r, val - 1);
    split_by_size(r, mid, r, 0);
    merge(root, l, r);
  }
  int64_t get_hash() { return root->hsh * mod1 + root->hsh1; }
};
int n;
vector<int> G[MAXN];
void read() {
  cin >> n;
  for (int i = 0; i < n - 1; i++) {
    int u, v;
    cin >> u >> v;
    G[u].push_back(v);
    G[v].push_back(u);
  }
}
int64_t rnd[MAXN];
pair<int, int> ans;
map<int64_t, int> cnt;
int64_t res = 0, dp[MAXN];
implicit_treap t[MAXN];
void pre_dfs(int u, int pr) {
  t[u].insert(1);
  for (int v : G[u])
    if (v != pr) {
      pre_dfs(v, u);
      t[u].insert(dp[v]);
    }
  dp[u] = (t[u].get_hash());
  cnt[dp[u]]++;
  if (cnt[dp[u]] == 1) res++;
}
void change_root(int cur, int nxt) {
  cnt[dp[cur]]--;
  if (cnt[dp[cur]] == 0) res--;
  t[cur].erase(dp[nxt]);
  dp[cur] = t[cur].get_hash();
  cnt[dp[cur]]++;
  if (cnt[dp[cur]] == 1) res++;
  cnt[dp[nxt]]--;
  if (cnt[dp[nxt]] == 0) res--;
  t[nxt].insert(dp[cur]);
  dp[nxt] = t[nxt].get_hash();
  cnt[dp[nxt]]++;
  if (cnt[dp[nxt]] == 1) res++;
}
void solve(int u, int pr) {
  ans = max(ans, {res, -u});
  for (int v : G[u])
    if (v != pr) {
      change_root(u, v);
      solve(v, u);
    }
  if (pr != -1) change_root(u, pr);
}
void solve() {
  pw[0] = 1;
  for (int i = 1; i < MAXN; i++) pw[i] = (pw[i - 1] * base) % mod;
  pw1[0] = 1;
  for (int i = 1; i < MAXN; i++) pw1[i] = (pw1[i - 1] * base1) % mod1;
  pre_dfs(1, 1);
  ans = {res, -1};
  solve(1, -1);
  cout << -ans.second << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  read();
  solve();
  return 0;
}
