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 = 100000 + 10;
const int C = 3;
const int MOD[C] = {1000000007, 1000000009, 1000000021};
int p2[C][N << 1];
struct Node *null;
struct Node {
  int key;
  int val[C];
  int size, len, hash[C];
  Node *ch[2];
  Node() {
    key = INT_MAX;
    size = 0;
    len = 0;
    for (int i = 0; i < C; ++i) {
      val[i] = hash[i] = 0;
    }
  }
  Node(int _val[C], int _len) {
    len = _len;
    size = len;
    for (int i = 0; i < C; ++i) {
      val[i] = _val[i];
      hash[i] = val[i];
    }
    key = bigRand();
    ch[0] = ch[1] = null;
  }
  int bigRand() { return rand() * RAND_MAX + rand(); }
  void update() {
    size = ch[0]->size + ch[1]->size + len;
    for (int i = 0; i < C; ++i) {
      hash[i] = (ch[0]->hash[i] + (long long)val[i] * p2[i][ch[0]->size] +
                 (long long)ch[1]->hash[i] * p2[i][ch[0]->size + len]) %
                MOD[i];
    }
  }
};
struct Treap {
  int cmp(const int a[C], const int b[C]) {
    for (int i = 0; i < C; ++i) {
      if (a[i] != b[i]) return a[i] - b[i];
    }
    return 0;
  }
  Node *root;
  int hsh[C];
  int len;
  Treap() {
    root = null;
    len = 2;
    for (int i = 0; i < C; ++i) {
      hsh[i] = 2;
    }
  }
  void update_info() {
    len = root->size + 2;
    for (int i = 0; i < C; ++i) {
      hsh[i] = (root->hash[i] * 2ll + p2[i][len - 1]) % MOD[i];
    }
  }
  void rot(Node *&t, int d) {
    Node *p = t->ch[d];
    t->ch[d] = p->ch[!d];
    p->ch[!d] = t;
    t->update();
    p->update();
    t = p;
  }
  void insert(Node *&t, int val[C], int len) {
    if (t == null) {
      t = new Node(val, len);
      return;
    }
    int dir = cmp(val, t->val) >= 0;
    insert(t->ch[dir], val, len);
    if (t->ch[dir]->key < t->key)
      rot(t, dir);
    else
      t->update();
  }
  void erase(Node *&t, int val[C]) {
    if (t == null) return;
    if (cmp(t->val, val) == 0) {
      int dir = t->ch[1]->key < t->ch[0]->key;
      if (t->ch[dir] == null) {
        delete t;
        t = null;
        return;
      }
      rot(t, dir);
      erase(t->ch[!dir], val);
      t->update();
      return;
    }
    bool dir = (cmp(val, t->val) > 0);
    erase(t->ch[dir], val);
    t->update();
  }
  void insert(int val[C], int len) {
    insert(root, val, len);
    update_info();
  }
  void erase(int val[C]) {
    erase(root, val);
    update_info();
  }
};
int n;
vector<int> adj[N];
Treap *root[N];
int ret, retu;
map<vector<int>, int> freq;
void insert(int vec[C]) {
  vector<int> v(vec, vec + C);
  freq[v]++;
}
void erase(int vec[C]) {
  vector<int> v(vec, vec + C);
  int &u = freq[v];
  --u;
  if (u == 0) {
    freq.erase(v);
  }
}
void get(int u, int f) {
  for (auto v : adj[u]) {
    if (v == f) continue;
    get(v, u);
    root[u]->insert(root[v]->hsh, root[v]->len);
  }
  insert(root[u]->hsh);
}
void dfs(int u, int f) {
  if ((int)freq.size() > ret) {
    ret = freq.size();
    retu = u;
  }
  for (auto v : adj[u]) {
    if (v == f) continue;
    erase(root[u]->hsh);
    root[u]->erase(root[v]->hsh);
    insert(root[u]->hsh);
    erase(root[v]->hsh);
    root[v]->insert(root[u]->hsh, root[u]->len);
    insert(root[v]->hsh);
    dfs(v, u);
    erase(root[v]->hsh);
    root[v]->erase(root[u]->hsh);
    insert(root[v]->hsh);
    erase(root[u]->hsh);
    root[u]->insert(root[v]->hsh, root[v]->len);
    insert(root[u]->hsh);
  }
}
void solve() {
  ios::sync_with_stdio(false);
  cin >> n;
  for (int i = 0; i < n - 1; ++i) {
    int u, v;
    cin >> u >> v;
    --u, --v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  for (int i = 0; i < n; ++i) {
    root[i] = new Treap();
  }
  freq.clear();
  get(0, -1);
  ret = -1;
  dfs(0, -1);
  cout << retu + 1 << endl;
}
int main() {
  for (int i = 0; i < C; ++i) {
    p2[i][0] = 1;
    for (int j = 1; j < N * 2; ++j) {
      p2[i][j] = p2[i][j - 1] * 2 % MOD[i];
    }
  }
  null = new Node();
  solve();
  return 0;
}
