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 mod = 1e9 + 7;
const int S = 3;
struct modint {
  int n;
  modint() : n(0) {}
  modint(int n) : n(n) {}
};
using modints = array<modint, S>;
modints one = {1, 1, 1};
modint operator+(modint a, modint b) {
  return modint((a.n += b.n) >= mod ? a.n - mod : a.n);
}
modint operator*(modint a, modint b) { return modint(1LL * a.n * b.n % mod); }
bool operator<(modint a, modint b) { return a.n < b.n; }
modints operator+(modints a, modints b) {
  modints ret;
  for (int i = 0; i < S; i++) {
    ret[i] = a[i] + b[i];
  }
  return ret;
}
modints operator*(modints a, modints b) {
  modints ret;
  for (int i = 0; i < S; i++) {
    ret[i] = a[i] * b[i];
  }
  return ret;
}
const int N = 1e5;
int n;
vector<int> g[N];
modints rnd[N];
int height[N];
vector<int> h;
modints val[N];
map<modints, int> mp;
pair<int, int> ans;
int cnt = 0;
void add(modints a) {
  if (mp[a]++ == 0) cnt++;
}
void del(modints a) {
  if (mp[a]-- == 1) cnt--;
}
void dfs(int u, int p) {
  for (int v : g[u])
    if (v != p) {
      dfs(v, u);
      height[u] = max(height[u], height[v] + 1);
    }
  val[u] = one;
  for (int v : g[u])
    if (v != p) {
      val[u] = val[u] * (rnd[height[u]] + val[v]);
    }
  add(val[u]);
}
void dfs2(int u, int p) {
  auto tmp = val[u];
  del(tmp);
  int n = g[u].size();
  h.clear();
  h.push_back(0);
  for (int v : g[u]) {
    h.push_back(height[v] + 1);
  }
  sort(h.rbegin(), h.rend());
  int h0 = h[0];
  int h1 = h[1];
  modints L0 = one;
  modints L1 = one;
  vector<modints> R0(n);
  vector<modints> R1(n);
  R0[n - 1] = one;
  R1[n - 1] = one;
  for (int i = n - 2; i >= 0; i--) {
    R0[i] = R0[i + 1] * (rnd[h0] + val[g[u][i + 1]]);
    R1[i] = R1[i + 1] * (rnd[h1] + val[g[u][i + 1]]);
  }
  ans = max(ans, make_pair(cnt, u));
  for (int i = 0; i < n; i++) {
    int v = g[u][i];
    if (height[v] + 1 != h0) {
      height[u] = h0;
      val[u] = L0 * R0[i];
    } else {
      height[u] = h1;
      val[u] = L1 * R1[i];
    }
    L0 = L0 * (rnd[h0] + val[v]);
    L1 = L1 * (rnd[h1] + val[v]);
    if (v == p) continue;
    add(val[u]);
    dfs2(v, u);
    del(val[u]);
  }
  add(tmp);
}
int main() {
  mt19937 mt(time(NULL));
  uniform_int_distribution<int> uni(0, mod - 1);
  for (int j = 0; j < S; j++) {
    auto t = uni(mt);
    for (int i = 0; i < N; i++) {
      rnd[i][j] = t;
    }
  }
  cin >> n;
  for (int i = 0; i < n - 1; i++) {
    int u, v;
    scanf("%d %d", &u, &v);
    u--;
    v--;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  if (n == 1) {
    cout << 1 << endl;
    return 0;
  }
  dfs(0, -1);
  dfs2(0, -1);
  cout << ans.second + 1 << endl;
}
