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 unsigned long long P = 210011;
const int N = 100002;
int myRand() { return rand() ^ (rand() << 15); }
struct Node {
  int x;
  int y;
  int l, r;
  pair<unsigned long long, unsigned long long> val;
  Node()
      : x(),
        y(),
        l(-1),
        r(-1),
        val(make_pair((unsigned long long)0, (unsigned long long)1)) {}
  Node(int _x)
      : x(_x),
        y(myRand()),
        l(-1),
        r(-1),
        val(make_pair((unsigned long long)_x, P)) {}
};
Node treap[2 * N];
int treapSz = 0;
pair<unsigned long long, unsigned long long> mergeHashes(
    pair<unsigned long long, unsigned long long> L,
    pair<unsigned long long, unsigned long long> R) {
  return make_pair(L.first * R.second + R.first, L.second * R.second);
}
pair<unsigned long long, unsigned long long> getHash(int v) {
  return v == -1 ? make_pair((unsigned long long)0, (unsigned long long)1)
                 : treap[v].val;
}
int update(int v) {
  if (v == -1) return v;
  treap[v].val =
      mergeHashes(mergeHashes(getHash(treap[v].l),
                              make_pair((unsigned long long)treap[v].x, P)),
                  getHash(treap[v].r));
  return v;
}
int merge(int L, int R) {
  if (L == -1) return R;
  if (R == -1) return L;
  if (treap[L].y > treap[R].y) {
    treap[L].r = merge(treap[L].r, R);
    return update(L);
  } else {
    treap[R].l = merge(L, treap[R].l);
    return update(R);
  }
}
void split(int v, int x, int &L, int &R) {
  if (v == -1) {
    L = R = -1;
    return;
  }
  if (treap[v].x < x) {
    split(treap[v].r, x, treap[v].r, R);
    L = update(v);
  } else {
    split(treap[v].l, x, L, treap[v].l);
    R = update(v);
  }
}
pair<unsigned long long, unsigned long long> getHashWithout(int &v, int x) {
  int L, M1, M2, M3, R;
  split(v, x, L, R);
  split(R, x + 1, M2, R);
  if (M2 == -1) throw;
  M1 = treap[M2].l, M3 = treap[M2].r;
  treap[M2].l = treap[M2].r = -1;
  M2 = update(M2);
  v = merge(merge(L, M1), merge(M3, R));
  pair<unsigned long long, unsigned long long> res = getHash(v);
  split(v, x, L, R);
  v = merge(L, merge(M2, R));
  return res;
}
void treapInsert(int &v, int x) {
  treap[treapSz++] = Node(x);
  int L, R;
  split(v, x, L, R);
  v = merge(L, merge(treapSz - 1, R));
  return;
}
int n;
int m = 1;
vector<pair<int, int> > g[N];
int deg[N];
int ed[N][2];
int a[N][2];
int q[2 * N];
int topQ;
bool usedV[N];
int sets[N];
map<unsigned long long, int> toId;
int cnt[2 * N];
int curBal = 0;
int bestVal = -1;
int ans = -1;
int getId(unsigned long long x) {
  if (toId.count(x) > 0) return toId[x];
  toId[x] = m;
  return m++;
}
void add(int x) {
  if (cnt[x] == 0) curBal++;
  cnt[x]++;
}
void remove(int x) {
  cnt[x]--;
  if (cnt[x] == 0) curBal--;
}
void dfs1(int v, int par) {
  for (pair<int, int> eid : g[v]) {
    int u = ed[eid.first][1 ^ eid.second];
    if (u == par) continue;
    add(a[eid.first][eid.second]);
    dfs1(u, v);
  }
  return;
}
void dfs2(int v, int par) {
  if (curBal > bestVal) {
    bestVal = curBal;
    ans = v;
  }
  for (pair<int, int> eid : g[v]) {
    int u = ed[eid.first][1 ^ eid.second];
    if (u == par) continue;
    remove(a[eid.first][eid.second]);
    add(a[eid.first][1 ^ eid.second]);
    dfs2(u, v);
    remove(a[eid.first][1 ^ eid.second]);
    add(a[eid.first][eid.second]);
  }
  return;
}
int main() {
  scanf("%d", &n);
  if (n == 1) {
    printf("1\n");
    return 0;
  }
  for (int i = 1; i < n; i++) {
    scanf("%d%d", &ed[i][0], &ed[i][1]);
    ed[i][0]--;
    ed[i][1]--;
    deg[ed[i][0]]++;
    deg[ed[i][1]]++;
    g[ed[i][0]].push_back(make_pair(i, 0));
    g[ed[i][1]].push_back(make_pair(i, 1));
  }
  for (int i = 1; i < n; i++) a[i][0] = a[i][1] = -1;
  for (int i = 0; i < n; i++) sets[i] = -1;
  for (int i = 0; i < n; i++)
    if (deg[i] == 1) q[topQ++] = i;
  for (int k = 0; k < topQ; k++) {
    int v = q[k];
    if (deg[v] > 1) throw;
    if (deg[v] == 1) {
      for (int i = 0; i < (int)g[v].size(); i++) {
        pair<int, int> e = g[v][i];
        if (a[e.first][e.second] == -1) {
          pair<unsigned long long, unsigned long long> h = getHash(sets[v]);
          unsigned long long hh = h.first + h.second;
          a[e.first][1 ^ e.second] = getId(hh);
          int u = ed[e.first][1 ^ e.second];
          treapInsert(sets[u], a[e.first][1 ^ e.second]);
          deg[u]--;
          if (deg[u] <= 1) q[topQ++] = u;
        }
      }
      continue;
    }
    if (usedV[v]) continue;
    usedV[v] = 1;
    for (int i = 0; i < (int)g[v].size(); i++) {
      pair<int, int> e = g[v][i];
      if (a[e.first][1 ^ e.second] == -1) {
        int x = a[e.first][e.second];
        if (x == -1) throw;
        pair<unsigned long long, unsigned long long> h =
            getHashWithout(sets[v], x);
        unsigned long long hh = h.first + h.second;
        a[e.first][1 ^ e.second] = getId(hh);
        int u = ed[e.first][1 ^ e.second];
        treapInsert(sets[u], a[e.first][1 ^ e.second]);
        deg[u]--;
        if (deg[u] <= 1) q[topQ++] = u;
      }
    }
  }
  dfs1(0, -1);
  dfs2(0, -1);
  printf("%d\n", ans + 1);
  return 0;
}
