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;
int mod = 1000000007;
int rnd[101010];
void pre() {
  mt19937 mt(time(NULL));
  uniform_int_distribution<int> uni(0, mod - 1);
  for (int i = 0; i < 101010; i++) rnd[i] = uni(mt);
}
int modpow(int a, long long b) {
  int ret = 1;
  while (b > 0) {
    if (b & 1) ret = 1LL * ret * a % mod;
    a = 1LL * a * a % mod;
    b >>= 1;
  }
  return ret;
}
int modinv(int a) { return modpow(a, mod - 2); }
map<int, int> hm;
int cnt = 0;
void add(int h) {
  if (hm[h] == 0) cnt++;
  hm[h]++;
}
void del(int h) {
  assert(0 < hm[h]);
  hm[h]--;
  if (hm[h] == 0) cnt--;
}
int N;
vector<int> E[101010];
int D[101010];
int H[101010];
void dfs(int cur, int par) {
  vector<int> hashs;
  for (int to : E[cur])
    if (to != par) {
      dfs(to, cur);
      hashs.push_back(H[to]);
      D[cur] = max(D[cur], D[to] + 1);
    }
  int ret = 1;
  for (int h : hashs) ret = (1LL * ret * ((h + rnd[D[cur]]) % mod)) % mod;
  add(ret);
  H[cur] = ret;
}
pair<int, int> ans;
void dfs2(int cur, int par) {
  int bak = H[cur];
  del(bak);
  ans = max(ans, {cnt, cur});
  vector<int> hei;
  hei.push_back(0);
  for (int to : E[cur]) hei.push_back(D[to] + 1);
  sort(hei.begin(), hei.end(), greater<int>());
  vector<int> hashs;
  for (int to : E[cur]) hashs.push_back(H[to]);
  int ha[2] = {1, 1};
  for (int i = 0; i < 2; i++) {
    int h = hei[i];
    for (int hh : hashs) {
      ha[i] = (1LL * ha[i] * ((hh + rnd[h]) % mod)) % mod;
    }
  }
  for (int to : E[cur]) {
    int idx = 0;
    if (hei[0] == D[to] + 1) idx = 1;
    int h = hei[idx];
    int has = (1LL * ha[idx] * modinv((H[to] + rnd[h]) % mod)) % mod;
    D[cur] = h;
    H[cur] = has;
    if (to == par) continue;
    add(has);
    dfs2(to, cur);
    del(has);
  }
  add(bak);
}
int main() {
  pre();
  cin >> N;
  for (int i = 0; i < N - 1; i++) {
    int a, b;
    scanf("%d %d", &a, &b);
    E[a].push_back(b);
    E[b].push_back(a);
  }
  dfs(1, 0);
  dfs2(1, 0);
  if (N == 1)
    cout << 1 << endl;
  else
    cout << ans.second << endl;
}
