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 = 998244353;
const int mod1 = 1e9 + 9;
int pwr(int a, int b) {
  int ans = 1;
  while (b) {
    if (b & 1) ans = (ans * 1LL * a) % mod;
    a = (a * 1LL * a) % mod;
    b >>= 1;
  }
  return ans;
}
int pwr1(int a, int b) {
  int ans = 1;
  while (b) {
    if (b & 1) ans = (ans * 1LL * a) % mod1;
    a = (a * 1LL * a) % mod1;
    b >>= 1;
  }
  return ans;
}
const int N = 1e5 + 5;
vector<int> g[N];
long long h[N], ph[N];
long long h1[N], ph1[N];
const long long P = 89512517;
const long long P1 = 75273453;
const int S1 = 986123;
const int S2 = 127836;
inline int max(int a, int b) { return ((a > b) ? a : b); }
void dfs(int u, int p) {
  h[u] = S1;
  h1[u] = S2;
  for (int v : g[u]) {
    if (v != p) {
      dfs(v, u);
      h[u] = (h[u] * (h[v] ^ P)) % mod;
      h1[u] = (h1[u] * (h1[v] ^ P1)) % mod1;
    }
  }
}
void dfs1(int u, int p) {
  long long val = h[u], val1 = h1[u];
  if (p) {
    val = (val * (ph[u] ^ P)) % mod;
    val1 = (val1 * (ph1[u] ^ P1)) % mod1;
  }
  for (int v : g[u]) {
    if (v != p) {
      ph[v] = (val * pwr((h[v] ^ P) % mod, mod - 2)) % mod;
      ph1[v] = (val1 * pwr1((h1[v] ^ P1) % mod1, mod1 - 2)) % mod1;
      dfs1(v, u);
    }
  }
}
int ans = -1, best = 0;
map<pair<long long, long long>, int> s;
inline void add(pair<long long, long long> a) { s[a]++; }
inline void del(pair<long long, long long> a) {
  s[a]--;
  if (s[a] == 0) s.erase(a);
}
void dfs2(int u, int p) {
  if (ans < (int)s.size()) {
    ans = s.size(), best = u;
  }
  for (int v : g[u]) {
    if (v != p) {
      pair<long long, long long> a = {h[v], h1[v]}, b = {ph[v], ph1[v]};
      del(a);
      add(b);
      dfs2(v, u);
      add(a);
      del(b);
    }
  }
}
int main() {
  ios ::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  for (int i = 1; i < n; i++) {
    int u, v;
    cin >> u >> v;
    g[u].push_back(v);
    g[v].push_back(u);
  }
  int root = 1;
  dfs(root, 0);
  dfs1(root, 0);
  for (int i = 2; i <= n; i++) {
    add({h[i], h1[i]});
  }
  dfs2(root, 0);
  cout << best << '\n';
  return 0;
}
