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 long long N = (long long)1e5 + 5, mod0 = (long long)1e9 + 7,
                mod1 = 1e9 + 9, base = 37;
struct crypt {
  long long h0, h1;
  crypt() { h0 = 1, h1 = 1; }
};
long long pw(long long a, long long b, long long mod) {
  b %= mod;
  if (b < 0) b += mod;
  return b != 0 ? pw(a * a % mod, b >> 1, mod) * (b & 1 ? a : 1) % mod : 1;
}
bool operator<(crypt x, crypt y) { return x.h0 < y.h0; }
crypt operator+(crypt o, crypt x) {
  o.h0 = (o.h0 + pw(base, x.h0, mod0)) % mod0;
  o.h1 = (o.h1 + pw(base, x.h1, mod1)) % mod1;
  return o;
}
crypt operator-(crypt o, crypt x) {
  o.h0 = (o.h0 - pw(base, x.h0, mod0) + mod0) % mod0;
  o.h1 = (o.h1 - pw(base, x.h1, mod1) + mod1) % mod1;
  return o;
}
vector<long long> adj[N];
long long val = 0;
crypt dw[N], up[N], all[N];
map<crypt, long long> cur;
void dfs_dw(long long v, long long p = -1) {
  for (long long u : adj[v])
    if (u != p) {
      dfs_dw(u, v);
      dw[v] = dw[v] + dw[u];
    }
  if (p != -1) val += cur[dw[v]], cur[dw[v]]++;
}
void dfs_up(long long v, long long p = -1, crypt upv = crypt()) {
  upv = up[v] = crypt() + upv;
  for (long long u : adj[v])
    if (u != p) upv = upv + dw[u];
  all[v] = upv;
  for (long long u : adj[v]) {
    if (u != p) {
      dfs_up(u, v, upv - dw[u]);
    }
  }
}
long long res[N];
long long dfs_res(long long v, long long p = -1) {
  if (p >= 0) {
    cur[dw[v]]--;
    val -= cur[dw[v]];
    val += cur[up[v]];
    cur[up[v]]++;
  }
  long long ret = v;
  res[v] = val;
  for (long long u : adj[v])
    if (u != p) {
      long long o = dfs_res(u, v);
      if (res[o] < res[ret]) ret = o;
    }
  if (p >= 0) {
    val += cur[dw[v]];
    cur[dw[v]]++;
    cur[up[v]]--;
    val -= cur[up[v]];
  }
  return ret;
}
int32_t main() {
  srand(49);
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  long long n;
  cin >> n;
  for (long long j = 1; j < n; ++j) {
    long long u, v;
    cin >> u >> v;
    --u, --v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  long long root = 0;
  dfs_dw(root);
  dfs_up(root);
  cout << dfs_res(root) + 1 << endl;
}
