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;
int ans, ansi;
const int N(111111);
int fa[N], cs[N], siz[N];
vector<int> adj[N];
long long pw(long long x, int n, int modulo) {
  long long res(1);
  while (n) {
    if (n & 1) res = res * x % modulo;
    x = x * x % modulo;
    n /= 2;
  }
  return res;
}
const int H(2);
struct Hash {
  int val[H];
  bool operator<(const Hash& b) const {
    for (int i(0); i < H; i++)
      if (val[i] != b.val[i]) return val[i] < b.val[i];
    return false;
  }
} hsh[N];
map<Hash, int> mp;
long long I[10], M[10] = {987654, 456789, 131072},
                 mod[10] = {1000000009, 1000000007, 1000003};
int n;
void go(int x, int y) {
  if (0 == --mp[hsh[x]]) {
    mp.erase(hsh[x]);
  }
  if (0 == --mp[hsh[y]]) {
    mp.erase(hsh[y]);
  }
  int nwcsx(cs[x] - 1);
  int nwsizx(siz[x] - siz[y]);
  int nwcsy(cs[y] + 1);
  int nwsizy(siz[x]);
  for (int i(0); i < H; i++) {
    int xval(((hsh[x].val[i] - cs[x] + mod[i]) * I[i] % mod[i]) *
             pw(siz[x], mod[i] - 2, mod[i]) % mod[i]);
    xval = (xval - hsh[y].val[i] + mod[i]) % mod[i];
    hsh[x].val[i] = ((xval * nwsizx) % mod[i] * M[i] + nwcsx) % mod[i];
    xval = ((hsh[y].val[i] - cs[y] + mod[i]) * I[i] % mod[i]) *
           pw(siz[x], mod[i] - 2, mod[i]) % mod[i];
    xval = (xval + hsh[x].val[i] + mod[i]) % mod[i];
    hsh[y].val[i] = ((xval * nwsizy) % mod[i] * M[i] + nwcsy) % mod[i];
  }
  cs[x] = nwcsx;
  cs[y] = nwcsy;
  siz[x] = nwsizx;
  siz[y] = nwsizy;
  mp[hsh[x]]++;
  mp[hsh[y]]++;
  if (mp.size() > ans) {
    ans = mp.size();
    ansi = y;
  }
}
int main() {
  for (int i(0); i < H; i++) {
    I[i] = pw(M[i], mod[i] - 2, mod[i]);
  }
  scanf("%d", &n);
  for (int qq(1); qq < n; qq++) {
    int x, y;
    cin >> x >> y;
    adj[x].push_back(y);
    adj[y].push_back(x);
  }
  vector<pair<int, int> > q;
  int rt = 1;
  q.push_back(make_pair(rt, 0));
  fa[rt] = 0;
  siz[rt] = 1;
  while (!q.empty()) {
    int v(q.back().first), p(q.back().second++);
    if (p != (int)adj[v].size()) {
      int y(adj[v][p]);
      if (y != fa[v]) {
        q.push_back(make_pair(y, 0));
        fa[y] = v;
        siz[y] = 1;
      }
    } else {
      for (int p(0); p < (int)adj[v].size(); p++) {
        int y(adj[v][p]);
        if (y != fa[v]) {
          siz[v] += siz[y];
          cs[v] += 1;
          for (int i(0); i < H; i++) {
            hsh[v].val[i] = (hsh[v].val[i] + hsh[y].val[i]) % mod[i];
          }
        }
      }
      for (int i(0); i < H; i++) {
        hsh[v].val[i] = (hsh[v].val[i] * siz[v]) % mod[i];
        hsh[v].val[i] = (hsh[v].val[i] * M[i] + cs[v]) % mod[i];
      }
      mp[hsh[v]]++;
      q.pop_back();
    }
  }
  ans = mp.size();
  ansi = rt;
  q.push_back(make_pair(rt, 0));
  while (!q.empty()) {
    int v(q.back().first), p(q.back().second++);
    if (p != (int)adj[v].size()) {
      int y(adj[v][p]);
      if (y != fa[v]) {
        go(v, y);
        q.push_back(make_pair(y, 0));
      }
    } else {
      q.pop_back();
      if (!q.empty()) go(v, q.back().first);
    }
  }
  printf("%d\n", ansi);
}
