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 MAXN = 1e5 + 5;
const long long MOD = 1e9 + 7;
struct hashing {
  long long x, y, z;
  void reset() {
    x = 0;
    y = 0;
    z = 1;
  }
  void fix() {
    x += 263790253;
    y = (y * 749027456) % MOD;
    z ^= 910273579;
  }
  hashing operator+(const hashing lain) const {
    hashing ret;
    ret.x = x ^ lain.x;
    ret.y = y + lain.y;
    ret.z = z * lain.z % MOD;
    return ret;
  }
  bool operator<(const hashing lain) const {
    if (x != lain.x) {
      return x < lain.x;
    }
    if (y != lain.y) {
      return y < lain.y;
    }
    if (z != lain.z) {
      return z < lain.z;
    }
    return 0;
  }
  bool operator!=(const hashing lain) const {
    if (x != lain.x) {
      return 1;
    }
    if (y != lain.y) {
      return 1;
    }
    if (z != lain.z) {
      return 1;
    }
    return 0;
  }
} turun[MAXN], naik[MAXN];
struct segment {
  int L, R;
  int val, lazy;
  segment *lef, *rig;
  void build(int x, int y) {
    L = x;
    R = y;
    val = 0;
    lazy = 0;
    if (x == y) {
      return;
    }
    int T = (L + R) / 2;
    lef = new segment;
    lef->build(L, T);
    rig = new segment;
    rig->build(T + 1, R);
    return;
  }
  void balance() {
    if (!lazy) {
      return;
    }
    lef->val += lazy;
    lef->lazy += lazy;
    rig->val += lazy;
    rig->lazy += lazy;
    lazy = 0;
    return;
  }
  void update(int x, int y) {
    if (x > R || y < L) {
      return;
    }
    if (x <= L && y >= R) {
      val++;
      lazy++;
      return;
    }
    balance();
    lef->update(x, y);
    rig->update(x, y);
    val = max(lef->val, rig->val);
    return;
  }
  int query() {
    if (L == R) {
      return L;
    }
    balance();
    if (lef->val == val) {
      return lef->query();
    }
    return rig->query();
  }
} data;
hashing ambil(int x) {
  if (x > 0) {
    return naik[x];
  }
  return turun[-x];
}
bool cmp(int x, int y) { return ambil(x) < ambil(y); }
int N, day;
int L[MAXN];
int R[MAXN];
int urut[2 * MAXN];
vector<int> edge[MAXN];
vector<pair<int, int> > simpan;
void dfsturun(int par, int now) {
  day++;
  L[now] = day;
  turun[now].reset();
  for (int next : edge[now]) {
    if (next == par) {
      continue;
    }
    dfsturun(now, next);
    turun[now] = turun[now] + turun[next];
  }
  turun[now].fix();
  R[now] = day;
  return;
}
void dfsnaik(int par, int now) {
  hashing save;
  save = naik[now];
  for (int i = edge[now].size() - 1; i >= 0; i--) {
    int next;
    next = edge[now][i];
    if (next == par) {
      continue;
    }
    naik[next] = save;
    save = save + turun[next];
  }
  save.reset();
  for (int next : edge[now]) {
    if (next == par) {
      continue;
    }
    naik[next] = naik[next] + save;
    save = save + turun[next];
    naik[next].fix();
    dfsnaik(now, next);
  }
  return;
}
void buang() {
  int C;
  C = 0;
  sort(simpan.begin(), simpan.end());
  for (pair<int, int> x : simpan) {
    data.update(max(x.first, C + 1), x.second);
    C = max(C, x.second);
  }
  simpan.clear();
  return;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> N;
  for (int i = 1; i < N; i++) {
    int x, y;
    cin >> x >> y;
    edge[x].push_back(y);
    edge[y].push_back(x);
    urut[i + 1] = i;
    urut[N + i] = -i;
  }
  dfsturun(0, N);
  naik[N].reset();
  dfsnaik(0, N);
  sort(urut + 2, urut + 2 * N, cmp);
  data.build(1, N);
  for (int i = 2; i < 2 * N; i++) {
    if (urut[i] > 0) {
      simpan.push_back({L[urut[i]], R[urut[i]]});
    } else {
      simpan.push_back({1, L[-urut[i]] - 1});
      simpan.push_back({R[-urut[i]] + 1, N});
    }
    if (i == 2 * N - 1 || ambil(urut[i]) != ambil(urut[i + 1])) {
      buang();
    }
  }
  int best;
  best = data.query();
  for (int i = 1; i <= N; i++) {
    if (L[i] == best) {
      cout << i << '\n';
      return 0;
    }
  }
  return 0;
}
