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 UNDEF = -1;
const long long INF = 1e9;
template <typename T>
inline bool chkmax(T &aa, T bb) {
  return aa < bb ? aa = bb, true : false;
}
template <typename T>
inline bool chkmin(T &aa, T bb) {
  return aa > bb ? aa = bb, true : false;
}
const long long MOD1 = 2106945901ULL;
const long long MOD2 = 2111011129ULL;
const long long P1 = 2131131137ULL;
const long long P2 = 2147483647ULL;
const long long mn = 1e5 + 2;
long long ge = 0;
long long vpar[2 * mn], vchild[2 * mn];
vector<long long> g[mn];
long long dp[2 * mn];
void ae(long long x, long long y) {
  vpar[ge] = x;
  vchild[ge] = y;
  g[x].push_back(ge);
  ge++;
  vpar[ge] = y;
  vchild[ge] = x;
  g[y].push_back(ge);
  ge++;
}
long long dpfy(long long x, long long y) {
  x %= MOD1;
  x = (x * x) % MOD1;
  y %= MOD2;
  y = (y * y) % MOD2;
  return (x << 32) | y;
}
long long filldown(long long ei) {
  if (dp[ei] != -1) return dp[ei];
  long long parent = vpar[ei];
  long long x = vchild[ei];
  long long hash1 = 1, hash2 = 1;
  for (auto &ek : g[x]) {
    if (ek == ge) continue;
    if (vchild[ek] == vpar[ei]) continue;
    long long w = filldown(ek);
    hash1 += w >> 32;
    hash2 += w & 0xffffffff;
  }
  hash1 %= MOD1;
  hash2 %= MOD2;
  return dp[ei] = dpfy(hash1, hash2);
}
void fillup(long long x, long long p) {
  long long hash1 = 1, hash2 = 1;
  for (auto &ek : g[x]) {
    if (ek == ge) continue;
    long long w = dp[ek];
    assert(w != -1);
    hash1 += w >> 32;
    hash2 += w & 0xffffffff;
  }
  hash1 %= MOD1;
  hash2 %= MOD2;
  for (auto &ek : g[x]) {
    if (ek == ge) continue;
    long long w = dp[ek];
    assert(w != -1);
    long long got1 = hash1 - (w >> 32);
    if (got1 < 0) got1 += MOD1;
    long long got2 = hash2 - (w & 0xffffffff);
    if (got2 < 0) got2 += MOD2;
    dp[ek ^ 1] = dpfy(got1, got2);
  }
  for (auto &ek : g[x]) {
    if (ek == ge) continue;
    if (vchild[ek] == p) continue;
    fillup(vchild[ek], x);
  }
}
long long f(long long ei) {
  assert(dp[ei] != -1);
  return dp[ei];
}
bool seen[mn];
map<long long, long long> h;
pair<long long, long long> final = make_pair(-1ll, -1ll);
void rm(long long x) {
  auto it = h.find(x);
  if (it->second == 1)
    h.erase(it);
  else
    (it->second)--;
}
void dfs(long long x) {
  seen[x] = true;
  chkmax(final, make_pair((long long)h.size(), x));
  for (auto &ei : g[x]) {
    if (ei == ge) continue;
    long long y = vchild[ei];
    if (seen[y]) continue;
    rm(f(ei));
    h[f(ei ^ 1)]++;
    dfs(y);
    rm(f(ei ^ 1));
    h[f(ei)]++;
  }
}
void initdfs(long long x) {
  seen[x] = true;
  for (auto &ei : g[x]) {
    if (ei == ge) continue;
    long long y = vchild[ei];
    if (seen[y]) continue;
    h[f(ei)]++;
    initdfs(y);
  }
}
int main() {
  long long n;
  scanf("%lld", &n);
  for (long long i = 1; i < n; i++) {
    long long x, y;
    scanf("%lld%lld", &x, &y);
    ae(x, y);
  }
  vpar[ge] = -123;
  vchild[ge] = 1;
  g[1].push_back(ge);
  memset(dp, -1, sizeof dp);
  filldown(ge);
  fillup(1, -123);
  memset(seen, 0, sizeof seen);
  initdfs(1);
  memset(seen, 0, sizeof seen);
  dfs(1);
  printf("%lld\n", final.second);
}
