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 M1 = 1e9 + 7;
const int M2 = 1e9 + 33;
const int P = 13;
const int Q = 1299821;
int IP1, IP2;
int pw(int x, int y, int mod) {
  int res = 1;
  while (y) {
    if (y & 1) res = (long long)res * x % mod;
    x = (long long)x * x % mod;
    y >>= 1;
  }
  return res;
}
vector<int> E[100010];
int n;
pair<int, int> H[100010], R[100010];
void add(pair<int, int> &a, pair<int, int> b) {
  a.first = (a.first + b.first) % M1;
  a.second = (a.second + b.second) % M2;
}
void mul(pair<int, int> &a, pair<int, int> b) {
  a.first = ((long long)a.first * b.first) % M1;
  a.second = ((long long)a.second * b.second) % M2;
}
void dfs(int x, int fa) {
  vector<pair<int, int> > SH;
  for (int e : E[x])
    if (e != fa) {
      dfs(e, x);
      SH.push_back(H[e]);
    }
  H[x] = pair<int, int>(1, 1);
  if ((int)SH.size() == 0) {
    return;
  }
  sort(SH.begin(), SH.end());
  pair<int, int> p = pair<int, int>(P, P), mu = pair<int, int>(Q, Q);
  for (int i = 0; i < (int)SH.size(); i++) {
    mul(mu, p);
    pair<int, int> temp = mu;
    mul(temp, SH[i]);
    add(H[x], temp);
  }
}
void dfs2(int x, int fa, pair<int, int> a) {
  R[x] = a;
  vector<tuple<int, int, int> > SH;
  if (fa != -1) SH.push_back(tuple<int, int, int>(a.first, a.second, fa));
  for (int e : E[x])
    if (e != fa) {
      SH.push_back(tuple<int, int, int>(H[e].first, H[e].second, e));
    }
  sort(SH.begin(), SH.end());
  pair<int, int> p = pair<int, int>(P, P), mu = pair<int, int>(Q, Q);
  for (int i = 0; i < (int)SH.size(); i++) {
    mul(mu, p);
    pair<int, int> temp = mu;
    mul(temp, pair<int, int>(get<0>(SH[i]), get<1>(SH[i])));
    get<0>(SH[i]) = temp.first;
    get<1>(SH[i]) = temp.second;
  }
  vector<pair<int, int> > sum;
  sum.resize((int)SH.size());
  for (int i = 0; i < (int)SH.size(); i++) sum[i].first = sum[i].second = 0;
  add(sum[(int)SH.size() - 1],
      pair<int, int>(get<0>(SH.back()), get<1>(SH.back())));
  for (int i = (int)SH.size() - 2; i >= 0; i--) {
    add(sum[i], sum[i + 1]);
    add(sum[i], pair<int, int>(get<0>(SH[i]), get<1>(SH[i])));
  }
  pair<int, int> now = pair<int, int>(1, 1);
  for (int i = 0; i < (int)SH.size(); i++) {
    int u = get<2>(SH[i]);
    if (u != fa) {
      pair<int, int> g = pair<int, int>(0, 0);
      if (i != (int)SH.size() - 1) {
        g = sum[i + 1];
        mul(g, pair<int, int>(IP1, IP2));
      }
      pair<int, int> temp = now;
      add(temp, g);
      dfs2(u, x, temp);
    }
    add(now, pair<int, int>(get<0>(SH[i]), get<1>(SH[i])));
  }
}
int ans[100010];
map<pair<int, int>, int> S;
void Do(int x, int fa) {
  for (int e : E[x])
    if (e != fa) {
      S[R[e]]++;
      S[H[e]]--;
      if (S[H[e]] == 0) S.erase(H[e]);
      ans[e] = (int)S.size();
      Do(e, x);
      S[R[e]]--;
      S[H[e]]++;
      if (S[R[e]] == 0) S.erase(R[e]);
    }
}
void solve() {
  IP1 = pw(P, M1 - 2, M1);
  IP2 = pw(P, M2 - 2, M2);
  scanf("%d", &n);
  if (n == 1) {
    puts("1");
    return;
  }
  for (int i = 0; i < n - 1; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    E[x].push_back(y);
    E[y].push_back(x);
  }
  dfs(1, -1);
  dfs2(1, -1, pair<int, int>(0, 0));
  for (int i = 2; i <= n; i++) S[H[i]]++;
  ans[1] = (int)S.size();
  Do(1, -1);
  printf("%d\n", (int)(max_element(ans + 1, ans + 1 + n) - ans));
}
int main() {
  int Tc = 1;
  for (int tc = 1; tc <= Tc; tc++) {
    solve();
  }
  return 0;
}
