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>
#pragma GCC optimize("O3")
const double PI = acos(-1);
template <class A, class B>
std::ostream& operator<<(std::ostream& st, const std::pair<A, B> p) {
  st << "(" << p.first << ", " << p.second << ")";
  return st;
}
using namespace std;
const int MAX = 100 * 1000 + 10;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
std::vector<int> cand_base{26,  29,  31,  37,  41,  43,  47,  53, 59,
                           61,  67,  71,  73,  79,  83,  89,  97, 101,
                           103, 107, 109, 113, 127, 131, 137, 139};
std::vector<int> cand_mod{1000001273, 1000001279, 1000001311, 1000001329,
                          1000001333};
int base[2], mod[2], base_power[2][MAX];
int n;
std::vector<int> adj[MAX];
int siz[MAX];
int add(int a, int b, int m) {
  a += b;
  if (a >= m) a -= m;
  if (a < 0) a += m;
  if (a >= m || a < 0) a = (a % m + m) % m;
  return a;
}
int mul(int a, int b, int m) { return (a * (long long)b) % m; }
void init_hashing() {
  srand(0);
  shuffle(cand_base.begin(), cand_base.end(), rng);
  shuffle(cand_mod.begin(), cand_mod.end(), rng);
  for (int i = 0; i < (2); i++) base[i] = cand_base[i] + n;
  for (int i = 0; i < (2); i++) mod[i] = cand_mod[i];
  for (int i = 0; i < (2); i++) base_power[i][0] = 1;
  for (int i = 0; i < 2; i++)
    for (int j = 0; j < MAX - 1; j++)
      base_power[i][j + 1] = mul(base_power[i][j], base[i], mod[i]);
}
struct DS {
  map<std::pair<int, int>, int> cnt;
  void add(std::pair<int, int> x, int v) {
    cnt[x] += v;
    if (cnt[x] == 0)
      cnt.erase(x);
    else
      assert(cnt[x] > 0);
  }
};
std::pair<int, int> f[MAX];
vector<pair<std::pair<int, int>, int>> children[MAX];
DS ds;
std::pair<int, int> merge(std::pair<int, int> L, std::pair<int, int> R,
                          int len) {
  std::pair<int, int> h;
  h.first = add(mul(L.first, base_power[0][len], mod[0]), R.first, mod[0]);
  h.second = add(mul(L.second, base_power[1][len], mod[1]), R.second, mod[1]);
  return h;
}
std::pair<int, int> dfs(int u, int p) {
  auto& C = children[u];
  for (int v : adj[u])
    if (v != p) {
      auto tmp = dfs(v, u);
      C.emplace_back(tmp, v);
      siz[u] += siz[v];
    }
  sort(C.begin(), C.end());
  f[u] = std::pair<int, int>(0, 0);
  siz[u] = 1;
  for (auto [h, v] : C) {
    f[u] = merge(f[u], h, siz[v]);
    siz[u] += siz[v];
  }
  f[u] = merge(f[u], std::pair<int, int>(siz[u], siz[u]), 1);
  ds.add(f[u], 1);
  return f[u];
}
std::pair<int, int> ans;
void dfs(int u, int p, std::pair<int, int> fp) {
  std::pair<int, int> old = f[u];
  ds.add(old, -1);
  ans = max(ans, std::pair<int, int>(ds.cnt.size(), -u));
  auto& C = children[u];
  if (p) {
    C.emplace_back(fp, p);
    sort(C.begin(), C.end());
  }
  int m = ((int)C.size());
  std::vector<int> sizes(m);
  std::vector<std::pair<int, int>> suff(m);
  for (int i = 0; i < (m); i++) {
    int v = C[i].second;
    sizes[i] = (v == p) ? (n - siz[u]) : siz[v];
  }
  for (int i = m - 1, tot = 0; i > 0; i--) {
    std::pair<int, int> h = C[i].first;
    suff[i - 1] = merge(h, suff[i], tot);
    tot += sizes[i];
  }
  std::pair<int, int> H(0, 0);
  int tot = 0;
  for (int i = 0; i < (m); i++) {
    auto [h, v] = C[i];
    int s = sizes[i];
    std::pair<int, int> tmp = merge(H, suff[i], n - 1 - s - tot);
    tmp = merge(tmp, std::pair<int, int>(n - s, n - s), 1);
    ds.add(tmp, 1);
    if (v != p) dfs(v, u, tmp);
    ds.add(tmp, -1);
    H = merge(H, h, s);
    tot += s;
  }
  ds.add(old, 1);
}
int main() {
  scanf("%d", &n);
  for (int e = 0; e < (n - 1); e++) {
    int a, b;
    scanf("%d %d", &a, &b);
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  init_hashing();
  dfs(1, 0);
  ans = std::pair<int, int>(-1, 0);
  dfs(1, 0, std::pair<int, int>(0, 0));
  cout << -ans.second << endl;
  return 0;
}
