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 N = 210000;
const int P = 998244353;
inline int Pow(int a, int b) {
  int c = 1;
  for (; b; b >>= 1, a = a * 1ll * a % P)
    if (b & 1) c = c * 1ll * a % P;
  return c;
}
inline void add(int &a, int b) {
  a += b;
  if (a >= P) a -= P;
}
inline void dec(int &a, int b) {
  a -= b;
  if (a < 0) a += P;
}
int head[N], np[N << 1], p[N << 1], tot;
int n;
int q[N], fa[N], down[N], up[N];
int calc(int x) { return (x * 1ll * x + 33333) % P; }
map<int, int> cnt;
int ans = 0;
int ma = 0;
int mares = 0;
void mapadd(int x, int v) {
  cnt[x] += v;
  if (cnt[x] == 0)
    ans--;
  else if (cnt[x] == 1)
    ans++;
}
void dfs(int x) {
  if (ans > mares) {
    mares = ans;
    ma = x;
  }
  for (int u = head[x]; u; u = np[u])
    if (p[u] ^ fa[x]) {
      mapadd(down[x], -1);
      mapadd(up[p[u]], 1);
      dfs(p[u]);
      mapadd(down[x], 1);
      mapadd(up[p[u]], -1);
    }
}
int main() {
  scanf("%d", &n);
  for (int i = (int)1; i <= (int)n - 1; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    ++tot;
    p[tot] = b;
    np[tot] = head[a];
    head[a] = tot;
    ++tot;
    p[tot] = a;
    np[tot] = head[b];
    head[b] = tot;
  }
  q[q[0] = 1] = 1;
  for (int i = (int)1; i <= (int)q[0]; i++) {
    int x = q[i];
    for (int u = head[x]; u; u = np[u])
      if (p[u] ^ fa[x]) {
        fa[p[u]] = x;
        q[++q[0]] = p[u];
      }
  }
  for (int i = (int)q[0]; i >= (int)1; i--) {
    int x = q[i];
    for (int u = head[x]; u; u = np[u])
      if (p[u] ^ fa[x]) add(down[x], down[p[u]]);
    down[x] = calc(down[x]);
  }
  for (int i = (int)1; i <= (int)q[0]; i++) {
    int x = q[i];
    int sum = up[x];
    for (int u = head[x]; u; u = np[u])
      if (p[u] ^ fa[x]) add(sum, down[p[u]]);
    for (int u = head[x]; u; u = np[u])
      if (p[u] ^ fa[x]) {
        up[p[u]] = sum;
        dec(up[p[u]], down[p[u]]);
        up[p[u]] = calc(up[p[u]]);
      }
  }
  for (int i = (int)1; i <= (int)n; i++) {
    mapadd(down[i], 1);
  }
  dfs(1);
  printf("%d\n", ma);
  return 0;
}
