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;
long long mod = 1000000009;
long long b = 1000003;
long long pw[100001];
map<pair<long long, int>, int> M;
int N;
vector<int> edges[100000];
int dval[100000];
int uval[100000];
int sz[100000];
int C;
int best, num;
void dfsDown(int i, int par) {
  sz[i] = 1;
  vector<int> v;
  for (int j = 0; j < edges[i].size(); j++)
    if (edges[i][j] != par) {
      dfsDown(edges[i][j], i);
      sz[i] += sz[edges[i][j]];
      v.push_back(dval[edges[i][j]]);
    }
  sort(v.begin(), v.end());
  long long hsh = 2;
  for (int j = 0; j < v.size(); j++) hsh = (hsh * b + v[j]) % mod;
  hsh = (hsh * b + 3) % mod;
  if (M.find(make_pair(hsh, sz[i])) == M.end()) {
    M[make_pair(hsh, sz[i])] = C++;
  }
  dval[i] = M[make_pair(hsh, sz[i])];
}
int val[100000];
long long lHash[100000];
long long rHash[100000];
bool cmp(int a, int b) { return val[a] < val[b]; }
void dfsUp(int i, int par) {
  if (edges[i].size() == 0) return;
  for (int j = 0; j < edges[i].size(); j++) {
    if (edges[i][j] != par)
      val[edges[i][j]] = dval[edges[i][j]];
    else
      val[edges[i][j]] = uval[i];
  }
  sort(edges[i].begin(), edges[i].end(), cmp);
  lHash[0] = 2;
  for (int j = 1; j < edges[i].size(); j++) {
    lHash[j] = (lHash[j - 1] * b + val[edges[i][j - 1]]) % mod;
  }
  rHash[edges[i].size() - 1] = 3;
  for (int j = edges[i].size() - 2; j >= 0; j--) {
    rHash[j] =
        (rHash[j + 1] + pw[edges[i].size() - 1 - j] * val[edges[i][j + 1]]) %
        mod;
  }
  for (int j = 0; j < edges[i].size(); j++) {
    if (edges[i][j] != par) {
      long long hsh =
          (rHash[j] + lHash[j] * ((long long)pw[edges[i].size() - j])) % mod;
      if (M.find(make_pair(hsh, N - sz[edges[i][j]])) == M.end())
        M[make_pair(hsh, N - sz[edges[i][j]])] = C++;
      uval[edges[i][j]] = M[make_pair(hsh, N - sz[edges[i][j]])];
    }
  }
  for (int j = 0; j < edges[i].size(); j++)
    if (edges[i][j] != par) dfsUp(edges[i][j], i);
}
int cnt[1000000];
int numDist;
void add(int c) {
  if (cnt[c] == 0) numDist++;
  cnt[c]++;
}
void remove(int c) {
  cnt[c]--;
  if (cnt[c] == 0) numDist--;
}
void dfsAns(int i, int par) {
  remove(dval[i]);
  if (i != 0) add(uval[i]);
  if (numDist > num) best = i, num = numDist;
  for (int j = 0; j < edges[i].size(); j++)
    if (edges[i][j] != par) dfsAns(edges[i][j], i);
  if (i != 0) remove(uval[i]);
  add(dval[i]);
}
int main() {
  C = 1;
  pw[0] = 1;
  for (int i = 1; i <= 100000; i++) pw[i] = (pw[i - 1] * b) % mod;
  cin >> N;
  int a, b;
  for (int i = 1; i < N; i++) {
    cin >> a >> b;
    edges[a - 1].push_back(b - 1);
    edges[b - 1].push_back(a - 1);
  }
  dfsDown(0, -1);
  dfsUp(0, -1);
  best = 0, num = 1;
  for (int i = 0; i < N; i++) {
    if (cnt[dval[i]] == 0) numDist++;
    cnt[dval[i]]++;
  }
  dfsAns(0, -1);
  cout << best + 1 << '\n';
}
