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 C = 26;
void add(int &x, int y) {
  x += y;
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
}
int fix(int x) {
  while (x >= MOD) x -= MOD;
  while (x < 0) x += MOD;
  return x;
}
int pw(int a, int b) {
  int ret = 1;
  while (b) {
    if (b & 1) ret = 1ll * ret * a % MOD;
    b >>= 1;
    a = 1ll * a * a % MOD;
  }
  return ret;
}
int mul(int a, int b) { return (long long)a * b % MOD; }
const int MAXN = 1e5 + 10;
int n, power[MAXN << 1];
vector<int> g[MAXN];
void plant() {
  power[0] = 1;
  for (int i = 1; i <= 2 * n; i++) {
    power[i] = fix(power[i - 1] + power[i - 1]);
  }
}
map<int, array<int, 2>> FUCK[MAXN];
map<array<int, 2>, int> fr;
array<int, 2> join(array<int, 2> a, array<int, 2> b) {
  return {a[0] + b[0], fix(a[1] + mul(power[a[0] << 1], b[1]))};
}
array<int, 2> wrap(array<int, 2> a) {
  return {a[0] + 1, fix(mul(2, a[1]) + 1)};
}
void dfs_up(int u, int p) {
  vector<array<int, 2>> ch;
  for (int v : g[u]) {
    if (v != p) {
      dfs_up(v, u);
      ch.push_back(wrap(FUCK[v][u]));
    }
  }
  sort(ch.begin(), ch.end());
  for (array<int, 2> a : ch) {
    FUCK[u][p] = join(FUCK[u][p], a);
  }
  ++fr[FUCK[u][p]];
}
void dfs_down(int u, int p) {
  vector<array<int, 2>> vec;
  for (int v : g[u]) {
    vec.push_back(wrap(FUCK[v][u]));
  }
  int deg = g[u].size();
  vector<int> sec(deg);
  iota(sec.begin(), sec.end(), 0);
  sort(sec.begin(), sec.end(), [&](int i, int j) { return vec[i] < vec[j]; });
  vector<array<int, 2>> pre(deg), suf(deg);
  pre[0] = vec[sec[0]];
  for (int i = 1; i < deg; i++) {
    pre[i] = join(pre[i - 1], vec[sec[i]]);
  }
  suf[deg - 1] = vec[sec[deg - 1]];
  for (int i = deg - 2; ~i; --i) {
    suf[i] = join(vec[sec[i]], suf[i + 1]);
  }
  for (int i = 0; i < deg; i++) {
    FUCK[u][g[u][sec[i]]] = join(i ? pre[i - 1] : array<int, 2>(),
                                 i + 1 < deg ? suf[i + 1] : array<int, 2>());
  }
  FUCK[u][-1] = pre[deg - 1];
  for (int v : g[u]) {
    if (v != p) {
      dfs_down(v, u);
    }
  }
}
void remove(array<int, 2> a) {
  if (--fr[a] == 0) {
    fr.erase(a);
  }
}
array<int, 2> ans;
void reroot(int u, int p) {
  ans = max(ans, {(int)fr.size(), u});
  for (int v : g[u]) {
    if (v != p) {
      remove(FUCK[u][-1]);
      remove(FUCK[v][u]);
      ++fr[FUCK[u][v]];
      ++fr[FUCK[v][-1]];
      reroot(v, u);
      ++fr[FUCK[u][-1]];
      ++fr[FUCK[v][u]];
      remove(FUCK[u][v]);
      remove(FUCK[v][-1]);
    }
  }
}
void solve() {
  cin >> n;
  if (n == 1) {
    cout << 1 << endl;
    return;
  }
  for (int i = 1; i < n; i++) {
    int a, b;
    cin >> a >> b;
    --a;
    --b;
    g[a].push_back(b);
    g[b].push_back(a);
  }
  plant();
  dfs_up(0, -1);
  dfs_down(0, -1);
  reroot(0, -1);
  cout << ans[1] + 1 << "\n";
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int te = 1;
  for (int w = 1; w <= te; w++) {
    solve();
  }
  return 0;
}
