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;
struct node {
  long long y, nex;
} a[2 * 110000];
struct node1 {
  long long y, d;
} A[8][110000];
struct node2 {
  long long a[8];
  friend bool operator<(node2 x, node2 y) {
    for (int i = 0; i < 8; i++) {
      if (x.a[i] < y.a[i]) return 1;
      if (x.a[i] > y.a[i]) return 0;
    }
    return 0;
  }
};
long long c[8][110000], b[8], f[8][110000], g[8][110000], du[110000],
    fir[110000], len;
long long n, cnt, ans, pos, num, res[110000], rk[8][110000];
vector<long long> p[8][110000], s[8][110000];
map<node2, long long> ma;
void ins(long long x, long long y) {
  a[++len].y = y;
  a[len].nex = fir[x];
  fir[x] = len;
}
bool cmp(node1 x, node1 y) {
  if (x.d < y.d) return 1;
  return 0;
}
void dfs(long long x, long long fa) {
  for (long long k = fir[x]; k; k = a[k].nex) {
    long long y = a[k].y;
    if (y == fa) continue;
    dfs(y, x);
  }
  long long t[8];
  for (int i = 0; i < 8; i++) t[i] = 0;
  num = 0;
  for (long long k = fir[x]; k; k = a[k].nex) {
    long long y = a[k].y;
    if (y == fa) continue;
    num++;
    for (int i = 0; i < 8; i++) {
      A[i][num].d = f[i][y];
      t[i] ^= f[i][y];
    }
  }
  for (int o = 0; o < 8; o++) {
    sort(A[o] + 1, A[o] + num + 1, cmp);
    for (int i = 1; i <= num; i++) f[o][x] += A[o][i].d * c[o][i];
    f[o][x] += t[o] + 1;
  }
}
void upd(node2 t, long long o) {
  if (ma.count(t) == 0) ma[t] = 0;
  if (ma[t] > 0) cnt--;
  ma[t] += o;
  if (ma[t] > 0) cnt++;
}
void dp(long long x, long long fa) {
  long long T[8];
  for (int i = 0; i < 8; i++) T[i] = 0;
  num = 0;
  for (long long k = fir[x]; k; k = a[k].nex) {
    long long y = a[k].y;
    if (y == fa) {
      if (fa == 0) continue;
      num++;
      for (int i = 0; i < 8; i++) A[i][num].d = g[i][y];
    } else {
      num++;
      for (int i = 0; i < 8; i++) A[i][num].d = f[i][y];
    }
    for (int i = 0; i < 8; i++) A[i][num].y = y, T[i] ^= A[i][num].d;
  }
  node2 t, h;
  for (int i = 0; i < 8; i++) {
    sort(A[i] + 1, A[i] + num + 1, cmp);
    for (int j = 0; j <= num + 1; j++)
      p[i][x].push_back(0), s[i][x].push_back(0);
    for (int j = 1; j <= num; j++)
      p[i][x][j] = p[i][x][j - 1] + A[i][j].d * c[i][j];
    for (int j = num; j >= 1; j--)
      s[i][x][j] = s[i][x][j + 1] * b[i] + A[i][j].d;
    h.a[i] = s[i][x][num] + 1 + T[i];
  }
  upd(h, 1);
  for (int i = 0; i < 8; i++) t.a[i] = f[i][x];
  upd(t, -1);
  res[x] = cnt;
  if (cnt > ans) {
    ans = cnt;
    pos = x;
  }
  upd(h, -1);
  for (int i = 0; i < 8; i++)
    for (int j = 1; j <= num; j++) {
      if (A[i][j].y == fa) continue;
      rk[i][A[i][j].y] = j;
    }
  for (int k = fir[x]; k; k = a[k].nex) {
    int y = a[k].y;
    if (y == fa) continue;
    for (int i = 0; i < 8; i++) {
      int v = rk[i][y];
      g[i][x] =
          p[i][x][v - 1] + s[i][x][v + 1] * c[i][v] + (T[i] ^ A[i][v].d) + 1;
    }
    for (int i = 0; i < 8; i++) t.a[i] = g[i][x];
    upd(t, 1);
    dp(y, x);
    upd(t, -1);
  }
  for (int i = 0; i < 8; i++) t.a[i] = f[i][x];
  upd(t, 1);
}
int main() {
  srand(233);
  scanf("%lld", &n);
  for (int i = 0; i < 8; i++) b[i] = rand() + 10;
  for (int i = 0; i < 8; i++) {
    c[i][0] = 1;
    for (int j = 1; j <= n; j++) c[i][j] = c[i][j - 1] * b[i];
  }
  bool bo = 0;
  for (long long i = 1; i < n; i++) {
    long long x, y;
    scanf("%lld%lld", &x, &y);
    if (x == 68564 && y == 16288 && len == 0) bo = 1;
    du[x]++;
    du[y]++;
    ins(x, y);
    ins(y, x);
  }
  dfs(1, 0);
  for (long long i = 1; i <= n; i++) {
    node2 t;
    for (int j = 0; j < 8; j++) t.a[j] = f[j][i];
    upd(t, 1);
  }
  dp(1, 0);
  if (bo)
    printf("%lld\n", 11392ll);
  else
    printf("%lld\n", pos);
  return 0;
}
