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 bool is_debug = true;
template <class T>
ostream &operator<<(ostream &a, vector<T> x) {
  for (auto element : x) {
    a << element << ' ';
  }
  return a;
}
template <class T>
istream &operator>>(istream &a, vector<T> x) {
  for (auto &element : x) {
    a >> x;
  }
  return a;
}
mt19937 rnd(time(0));
const long long mod = 1e9 + 1;
const long long p = 179;
long long pw[2 * 100228];
long long hashsum(long long h1, int l1, long long h2, int l2) {
  return ((h1 * pw[l2]) % mod + h2) % mod;
}
struct Node {
  int p, hash, len, val, selflen;
  Node *l, *r;
  Node() : p(rnd()), hash(0), l(nullptr), r(nullptr){};
  Node(int val, int len)
      : p(rnd()),
        val(val),
        hash(val),
        selflen(len),
        len(len),
        l(nullptr),
        r(nullptr){};
};
typedef Node *PNode;
int getlen(PNode v) {
  if (!v) return 0;
  return v->len;
}
int gethash(PNode v) {
  if (!v) return 0;
  return v->hash;
}
void update(PNode root) {
  if (!root) return;
  root->len = getlen(root->l) + getlen(root->r) + root->selflen;
  long long hs = hashsum(gethash(root->l), 0, root->val, root->selflen);
  hs = hashsum(hs, 0, gethash(root->r), getlen(root->r));
  root->hash = hs;
}
void split(PNode root, PNode &l, PNode &r, int x) {
  if (!root) return void(l = r = nullptr);
  if (root->val < x) {
    split(root->r, root->r, r, x);
    l = root;
    update(l);
  } else {
    split(root->l, l, root->l, x);
    r = root;
    update(r);
  }
}
void merge(PNode &root, PNode l, PNode r) {
  if (!l || !r) return void(root = l ? l : r);
  if (l->p > r->p) {
    merge(l->r, l->r, r);
    root = l;
  } else {
    merge(r->l, l, r->l);
    root = r;
  }
  update(root);
}
void insert(PNode &root, PNode &ins) {
  PNode r1, r2;
  split(root, r1, r2, ins->val);
  merge(root, r1, ins);
  merge(root, root, r2);
}
void erase(PNode &root, long long val) {
  if (!root) return;
  if (root->val == val) {
    merge(root, root->l, root->r);
    return;
  }
  if (root->val > val) {
    erase(root->l, val);
  } else {
    erase(root->r, val);
  }
  update(root);
}
long long get_hash(PNode v) {
  if (!v) return 181;
  long long cur = hashsum(1, 1, v->hash, v->len);
  cur = hashsum(cur, v->len + 1, 2, 1);
  return cur;
}
vector<vector<int>> g;
vector<PNode> ch_hashes;
unordered_map<long long, int> cnt;
int curcnt = 0;
vector<long long> hashes;
void remove_hash(long long h) {
  cnt[h]--;
  if (cnt[h] == 0) curcnt--;
}
void add_hash(long long h) {
  if (cnt[h] == 0) curcnt++;
  cnt[h]++;
}
void change_order(int v, int u) {
  remove_hash(hashes[u]);
  remove_hash(hashes[v]);
  erase(ch_hashes[v], hashes[u]);
  hashes[v] = get_hash(ch_hashes[v]);
  PNode ins = new Node(hashes[v], getlen(ch_hashes[v]) + 2);
  insert(ch_hashes[u], ins);
  hashes[u] = get_hash(ch_hashes[u]);
  add_hash(hashes[u]);
  add_hash(hashes[v]);
}
int ans = 0, mx = 0;
void dfs(int v, int par) {
  if (curcnt > mx) {
    mx = curcnt;
    ans = v;
  }
  for (auto u : g[v]) {
    if (u == par) continue;
    change_order(v, u);
    dfs(u, v);
    change_order(u, v);
  }
}
void build_hashes(int v, int par) {
  if (par != -1 && g[v].size() == 1) {
    ch_hashes[v] = nullptr;
    hashes[v] = hashsum(1, 1, 2, 1);
    add_hash(hashes[v]);
    return;
  }
  ch_hashes[v] = nullptr;
  for (auto u : g[v]) {
    if (u == par) continue;
    build_hashes(u, v);
    PNode ins = new Node(hashes[u], getlen(ch_hashes[u]) + 2);
    insert(ch_hashes[v], ins);
  }
  hashes[v] = get_hash(ch_hashes[v]);
  add_hash(hashes[v]);
}
long long counthash(vector<long long> el) {
  if (el.size() == 0) return 0;
  if (el.size() == 1) return el[0];
  el[0] = hashsum(el[0], 0, el[1], 1);
  for (int i = 1; i < el.size() - 1; ++i) {
    el[i] = el[i + 1];
  }
  el.pop_back();
  return counthash(el);
}
signed main() {
  pw[0] = 1;
  for (int i = 1; i < 2 * 100228; ++i) pw[i] = (pw[i - 1] * p) % mod;
  int n;
  cin >> n;
  g.resize(n);
  for (int i = 0; i < n - 1; ++i) {
    int x, y;
    cin >> x >> y;
    --x;
    --y;
    g[x].push_back(y);
    g[y].push_back(x);
  }
  hashes.resize(n);
  ch_hashes.resize(n);
  build_hashes(0, -1);
  dfs(0, -1);
  cout << ans + 1;
  return 0;
}
