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 N = 100010;
const int MOD[2] = {1000000007, 1000000009};
long long bigMod(long long a, long long e, int id) {
  if (e == -1) e = MOD[id] - 2;
  long long ret = 1;
  while (e) {
    if (e & 1) ret = ret * a % MOD[id];
    a = a * a % MOD[id], e >>= 1;
  }
  return ret;
}
vector<int> g[N];
unordered_map<long long, int> freq;
long long x[N][2], subHash[N][2], upHash[N][2], mem[N][2], rootHash[N][2];
int n, subDeep[N], upDeep[N], par[N], ans, maxDistinct, curDistinct;
void fix(int u = 1) {
  for (int v : g[u])
    g[v].erase(find(g[v].begin(), g[v].end(), u)), par[v] = u, fix(v);
}
void dfsDown(int u = 1) {
  subDeep[u] = 0;
  for (int v : g[u]) {
    dfsDown(v);
    subDeep[u] = max(subDeep[u], 1 + subDeep[v]);
  }
  subHash[u][0] = subHash[u][1] = 1;
  for (int v : g[u]) {
    subHash[u][0] = subHash[u][0] * (x[subDeep[u]][0] + subHash[v][0]) % MOD[0];
    subHash[u][1] = subHash[u][1] * (x[subDeep[u]][1] + subHash[v][1]) % MOD[1];
  }
}
void dfsUp(int u = 1) {
  sort(g[u].begin(), g[u].end(),
       [](int i, int j) { return subDeep[i] > subDeep[j]; });
  int tmp = 1 + upDeep[u];
  mem[tmp][0] = mem[tmp][1] = 1;
  for (int v : g[u]) {
    mem[tmp][0] = mem[tmp][0] * (x[tmp][0] + subHash[v][0]) % MOD[0];
    mem[tmp][1] = mem[tmp][1] * (x[tmp][1] + subHash[v][1]) % MOD[1];
  }
  if (!g[u].empty()) {
    tmp = 1 + subDeep[g[u][0]];
    for (int v : g[u]) {
      mem[tmp][0] = mem[tmp][0] * (x[tmp][0] + subHash[v][0]) % MOD[0];
      mem[tmp][1] = mem[tmp][1] * (x[tmp][1] + subHash[v][1]) % MOD[1];
    }
  }
  if (g[u].size() > 1) {
    tmp = 1 + subDeep[g[u][1]];
    mem[tmp][0] = mem[tmp][1] = 1;
    for (int v : g[u]) {
      mem[tmp][0] = mem[tmp][0] * (x[tmp][0] + subHash[v][0]) % MOD[0];
      mem[tmp][1] = mem[tmp][1] * (x[tmp][1] + subHash[v][1]) % MOD[1];
    }
  }
  for (int v : g[u]) {
    upDeep[v] = 1 + upDeep[u];
    mem[tmp][0] = mem[tmp][1] = 1;
    if (v != g[u][0])
      upDeep[v] = max(upDeep[v], 1 + subDeep[g[u][0]]);
    else if (g[u].size() > 1)
      upDeep[v] = max(upDeep[v], 1 + subDeep[g[u][1]]);
    upHash[v][0] = mem[upDeep[v]][0] *
                   bigMod((x[upDeep[v]][0] + subHash[v][0]) % MOD[0], -1, 0) %
                   MOD[0];
    upHash[v][1] = mem[upDeep[v]][1] *
                   bigMod((x[upDeep[v]][1] + subHash[v][1]) % MOD[1], -1, 1) %
                   MOD[1];
    if (u ^ 1) {
      upHash[v][0] = upHash[v][0] * (x[upDeep[v]][0] + upHash[u][0]) % MOD[0];
      upHash[v][1] = upHash[v][1] * (x[upDeep[v]][1] + upHash[u][1]) % MOD[1];
    }
    dfsUp(v);
  }
}
inline void insert(long long val) {
  if (!freq[val]) ++curDistinct;
  ++freq[val];
}
inline void remove(long long val) {
  --freq[val];
  if (!freq[val]) --curDistinct;
}
void dfs(int u = 1) {
  if (curDistinct > maxDistinct) {
    maxDistinct = curDistinct, ans = u;
  }
  for (int v : g[u]) {
    remove(subHash[v][0] << 31LL | subHash[v][1]);
    remove(rootHash[u][0] << 31LL | rootHash[u][1]);
    insert(rootHash[v][0] << 31LL | rootHash[v][1]);
    insert(upHash[v][0] << 31LL | upHash[v][1]);
    dfs(v);
    insert(subHash[v][0] << 31LL | subHash[v][1]);
    insert(rootHash[u][0] << 31LL | rootHash[u][1]);
    remove(rootHash[v][0] << 31LL | rootHash[v][1]);
    remove(upHash[v][0] << 31LL | upHash[v][1]);
  }
}
int main() {
  mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
  for (int i = 0; i < N; ++i) {
    long long cur = rng();
    x[i][0] = cur % MOD[0], x[i][1] = cur % MOD[1];
  }
  cin >> n;
  for (int i = 1, u, v; i < n; ++i) {
    scanf("%d %d", &u, &v);
    g[u].emplace_back(v);
    g[v].emplace_back(u);
  }
  fix();
  dfsDown();
  dfsUp();
  for (int i = 1; i <= n; ++i) ++freq[subHash[i][0] << 31LL | subHash[i][1]];
  for (int i = 1; i <= n; ++i) {
    rootHash[i][0] = rootHash[i][1] = 1;
    int tmp = max(subDeep[i], upDeep[i]);
    for (int v : g[i]) {
      rootHash[i][0] = rootHash[i][0] * (x[tmp][0] + subHash[v][0]) % MOD[0];
      rootHash[i][1] = rootHash[i][1] * (x[tmp][1] + subHash[v][1]) % MOD[1];
    }
    if (i > 1) {
      rootHash[i][0] = rootHash[i][0] * (x[tmp][0] + upHash[i][0]) % MOD[0];
      rootHash[i][1] = rootHash[i][1] * (x[tmp][1] + upHash[i][1]) % MOD[1];
    }
  }
  ans = 1, maxDistinct = curDistinct = freq.size();
  dfs();
  cout << ans << '\n';
  return 0;
}
