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 = 1e5 + 5;
const int base = 100003;
using namespace std;
struct edge {
  int to, next;
} G[maxn << 1];
int head[maxn], tot, tol, num[maxn << 1], id[maxn], ansv, ansnum, cnt;
map<unsigned long long, int> mp;
vector<int> vec[maxn];
vector<unsigned long long> sum[maxn];
unsigned long long p[maxn], h[maxn];
void init() {
  memset(head, -1, sizeof(head));
  tot = tol = 0;
}
void addedge(int u, int v) {
  G[tot] = edge{v, head[u]};
  head[u] = tot++;
}
int getid(unsigned long long x) {
  if (mp.find(x) != mp.end()) return mp[x];
  mp.insert(pair<unsigned long long, int>(x, ++tol));
  return tol;
}
void setid(int u) {
  h[u] = 0;
  if (!vec[u].empty()) {
    sort(vec[u].begin(), vec[u].end());
    sum[u].clear();
    sum[u].push_back(vec[u][0]);
    h[u] = vec[u][0];
    for (int i = 1; i < vec[u].size(); ++i) {
      h[u] = h[u] * base + vec[u][i];
      sum[u].push_back(h[u]);
    }
  }
  id[u] = getid(h[u]);
}
void add(int x) {
  ++num[x];
  if (num[x] == 1) ++cnt;
}
void sub(int x) {
  --num[x];
  if (num[x] == 0) --cnt;
}
void dfs1(int u, int fa) {
  for (int i = head[u]; ~i; i = G[i].next) {
    int v = G[i].to;
    if (v == fa) continue;
    dfs1(v, u);
    vec[u].push_back(id[v]);
  }
  setid(u);
  ++num[id[u]];
}
void dfs2(int u, int fa) {
  if (cnt > ansnum) {
    ansv = u;
    ansnum = cnt;
  }
  int sz = vec[u].size();
  for (int i = head[u]; ~i; i = G[i].next) {
    int v = G[i].to;
    if (v == fa) continue;
    int pos = lower_bound(vec[u].begin(), vec[u].end(), id[v]) - vec[u].begin();
    unsigned long long t = 0;
    if (pos > 0) t += sum[u][pos - 1] * p[sz - pos - 1];
    if (pos < sz - 1) t += sum[u].back() - sum[u][pos] * p[sz - pos - 1];
    int tmp1 = getid(t), tmp2 = id[v];
    vec[v].push_back(tmp1);
    setid(v);
    add(tmp1), add(id[v]), sub(id[u]), sub(tmp2);
    dfs2(v, u);
    add(id[u]), add(tmp2), sub(tmp1), sub(id[v]);
  }
}
int main() {
  p[0] = 1;
  for (int i = 1; i < maxn; ++i) p[i] = p[i - 1] * base;
  int n;
  init();
  scanf("%d", &n);
  for (int i = 1; i < n; ++i) {
    int u, v;
    scanf("%d%d", &u, &v);
    addedge(u, v);
    addedge(v, u);
  }
  dfs1(1, 0);
  ansnum = -1;
  cnt = 0;
  for (int i = 1; i <= tol; ++i)
    if (num[i] > 0) ++cnt;
  dfs2(1, 0);
  printf("%d\n", ansv);
  return 0;
}
