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>
#pragma comment(linker, "/STACK:100000000")
using namespace std;
const int N = 100010;
vector<int> m[N];
int n, u[N], d[N], p[N];
pair<double, double> h[N];
void dfs(int i) {
  u[i] = 1;
  for (auto j : m[i])
    if (!u[j]) {
      d[j] = d[i] + 1;
      p[j] = i;
      dfs(j);
    }
}
int fndlong(int i) {
  for (int j = 0; j < n; u[j] = 0, j++)
    ;
  int bj = 0;
  d[i] = 0;
  dfs(i);
  for (int j = 0; j < n; j++)
    if (d[j] > d[bj]) bj = j;
  return bj;
}
void insv(int i, int j) {
  m[i].erase(find(m[i].begin(), m[i].end(), j));
  m[j].erase(find(m[j].begin(), m[j].end(), i));
  m[i].push_back(n);
  m[j].push_back(n);
  m[n].push_back(i);
  m[n].push_back(j);
}
map<pair<double, double>, int> w;
void dfs2(int i) {
  u[i] = 1;
  vector<pair<double, double> > d;
  for (auto j : m[i])
    if (!u[j]) {
      dfs2(j);
      d.push_back(h[j]);
    }
  sort(d.begin(), d.end());
  h[i] = {0, 0};
  for (auto x : d) {
    h[i].first += cos(x.first + 1);
    h[i].second += sin(x.second + 1);
  }
  w[h[i]]++;
}
void dfs3(int i) {
  u[i] = 1;
  p[i] = -1;
  d[i] = 0;
  for (auto j : m[i])
    if (!u[j]) {
      dfs3(j);
      if (d[j] > d[i]) {
        d[i] = d[j];
        p[i] = j;
      }
    }
  d[i] += w[h[i]] > 1;
}
int main() {
  int i, j, k;
  scanf("%d", &n);
  for (k = n - 1; k--;
       scanf("%d%d", &i, &j), i--, j--, m[i].push_back(j), m[j].push_back(i))
    ;
  i = fndlong(0);
  i = fndlong(i);
  j = fndlong(i);
  int l = 0;
  for (k = j; k != i; l++, k = p[k])
    ;
  int c = l / 2;
  for (k = j; c > 0; c--, k = p[k])
    ;
  c = k;
  if (l % 2) {
    insv(c, p[c]);
    c = n;
    n++;
  }
  for (i = 0; i < n; u[i] = 0, i++)
    ;
  dfs2(c);
  for (i = 0; i < n; u[i] = 0, i++)
    ;
  dfs3(c);
  for (i = c; p[i] != -1; i = p[i])
    ;
  printf("%d\n", i + 1);
  return 0;
}
