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>
struct csegtree {
  int size;
  int left, right;
  csegtree(int size, int left, int right)
      : size(size), left(left), right(right) {}
  bool operator<(struct csegtree other) const {
    if (size != other.size) {
      return size < other.size;
    }
    if (left != other.left) {
      return left < other.left;
    }
    return right < other.right;
  }
};
std::vector<struct csegtree> segtree_v;
std::map<struct csegtree, int> segtree_m;
int construct(struct csegtree segtree) {
  if (!segtree_m.count(segtree)) {
    int id = segtree_v.size();
    segtree_m[segtree] = id;
    segtree_v.push_back(segtree);
  }
  return segtree_m[segtree];
}
int construct(int size, int left, int right) {
  return construct(csegtree(size, left, right));
}
int constructsingle(int val) { return construct(1, -1, val); }
int constructempty(int size) {
  int st = constructsingle(0);
  for (int size2 = 1; size2 < size; size2 *= 2) {
    st = construct(size2 * 2, st, st);
  }
  return st;
}
int add(int st, int index, int val) {
  struct csegtree segtree = segtree_v[st];
  if ((index < 0) || (index >= segtree.size)) {
    std::cerr << "WARNING: segment tree index OOB" << std::endl;
    return st;
  }
  if (segtree.size == 1) {
    return constructsingle(segtree.right + val);
  }
  if (index < segtree.size / 2) {
    return construct(segtree.size, add(segtree.left, index, val),
                     segtree.right);
  } else {
    return construct(segtree.size, segtree.left,
                     add(segtree.right, index - segtree.size / 2, val));
  }
}
void dump(int st) {
  struct csegtree segtree = segtree_v[st];
  if (segtree.size == 1) {
    std::cout << segtree.right << " ";
  } else {
    dump(segtree.left);
    dump(segtree.right);
  }
}
std::map<int, int> isotree_m;
std::vector<int> isotree_v;
int constructisotree(int val) {
  if (!isotree_m.count(val)) {
    int id = isotree_v.size();
    isotree_m[val] = id;
    isotree_v.push_back(val);
  }
  return isotree_m[val];
}
int N;
std::vector<int> edges[100000];
int subtree_id[100000];
int fulltree_id[100000];
std::map<int, int> isos;
void isos_insert(int id) { isos[id]++; }
void isos_erase(int id) {
  if (--isos[id] == 0) {
    isos.erase(id);
  }
}
int isos_getsize() { return isos.size(); }
void dfs1(int node, int parent) {
  int st = constructempty(N * 3);
  for (int child : edges[node]) {
    if (child != parent) {
      dfs1(child, node);
      st = add(st, subtree_id[child], 1);
    }
  }
  subtree_id[node] = constructisotree(st);
  isos_insert(subtree_id[node]);
}
void dfs2(int node, int parent) {
  if (parent == -1) {
    fulltree_id[node] = subtree_id[node];
  } else {
    int parenttree = constructisotree(
        add(isotree_v[fulltree_id[parent]], subtree_id[node], -1));
    fulltree_id[node] =
        constructisotree(add(isotree_v[subtree_id[node]], parenttree, 1));
  }
  for (int child : edges[node]) {
    if (child != parent) {
      dfs2(child, node);
    }
  }
}
std::pair<int, int> best(-1, -1);
void dfs3(int node, int parent) {
  isos_erase(subtree_id[node]);
  best = std::max(best, std::make_pair(isos_getsize(), node));
  for (int child : edges[node]) {
    if (child != parent) {
      int tmptree = constructisotree(
          add(isotree_v[fulltree_id[node]], subtree_id[child], -1));
      isos_insert(tmptree);
      dfs3(child, node);
      isos_erase(tmptree);
    }
  }
  isos_insert(subtree_id[node]);
}
int main() {
  std::cin >> N;
  for (int i = 0; i < N - 1; i++) {
    int U, V;
    std::cin >> U >> V;
    U--, V--;
    edges[U].push_back(V);
    edges[V].push_back(U);
  }
  dfs1(0, -1);
  dfs2(0, -1);
  dfs3(0, -1);
  std::cout << best.second + 1 << std::endl;
  return 0;
}
