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 = 100005, M = 100005, mod = 1e9 + 7;
template <class T>
inline void gmin(T &x, const T &y) {
  if (x > y) x = y;
}
template <class T>
inline void gmax(T &x, const T &y) {
  if (x < y) x = y;
}
inline void ch(int &x, int y) { x = (x + y) % mod; }
template <class T>
inline void read(T &x) {
  x = 0;
  char ch = getchar(), rev = 0;
  while (ch > '9' || ch < '0') rev = (ch == '-'), ch = getchar();
  while (ch >= '0' && ch <= '9') x = x * 10 + ch - '0', ch = getchar();
  x = rev ? -x : x;
}
template <class T>
inline void print(T x) {
  if (!x) {
    puts("0");
    return;
  }
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  int a[20], m = 0;
  while (x) a[m++] = x % 10, x /= 10;
  while (m--) putchar(a[m] + '0');
  puts("");
}
inline int exp(int x, int y) {
  int ans = 1;
  while (y) {
    if (y & 1) ans = (long long)ans * x % mod;
    x = (long long)x * x % mod;
    y >>= 1;
  }
  return ans;
}
struct node {
  int to, next;
} p[N << 1];
int n, tot, res, ans, id, root, head[N], si[N];
bool vis[N], tag[N];
unsigned long long dp[N];
map<unsigned long long, int> cnt;
void add(int x, int y) {
  p[++tot] = (node){y, head[x]};
  head[x] = tot;
  p[++tot] = (node){x, head[y]};
  head[y] = tot;
}
void getroot(int x, int fa) {
  si[x] = 1;
  int tmp = 0;
  for (int i = head[x]; i; i = p[i].next) {
    int y = p[i].to;
    if (y == fa) continue;
    getroot(y, x);
    si[x] += si[y];
    gmax(tmp, si[y]);
  }
  gmax(tmp, n - si[x]);
  if (tmp < res) res = tmp, root = x;
}
void dfs(int x) {
  si[x] = vis[x] = dp[x] = 1;
  for (int i = head[x]; i; i = p[i].next) {
    int y = p[i].to;
    if (vis[y]) continue;
    dfs(y);
    dp[x] = dp[x] * dp[y];
    si[x] += si[y];
  }
  dp[x] -= si[x] * 12057194353019ll;
  dp[x] ^= (long long)si[x] * si[x] * si[x] * si[x];
  cnt[dp[x]]++;
}
void dfs(int x, int now) {
  vis[x] = 1;
  now += tag[x];
  if (make_pair(now, -x) > make_pair(ans, -id)) ans = now, id = x;
  for (int i = head[x]; i; i = p[i].next) {
    int y = p[i].to;
    if (vis[y]) continue;
    dfs(y, now);
  }
}
int main() {
  ios::sync_with_stdio(0);
  read(n);
  for (int i = 1; i < n; i++) {
    int x, y;
    read(x);
    read(y);
    add(x, y);
  }
  res = n;
  getroot(1, 0);
  dfs(root);
  for (int i = 1; i <= n; i++)
    if (cnt[dp[i]] > 1) tag[i] = 1;
  memset(vis, 0, sizeof(vis));
  ans = -1;
  dfs(root, 0);
  printf("%d\n", id);
  return 0;
}
