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;
void pr(int x);
void pr(const char* x);
void ps();
template <class T, class... Ts>
void ps(const T& t, const Ts&... ts);
int n, a, b;
vector<pair<int, int> > edges;
vector<int> adj[210000];
unsigned long long t[210000];
int size[210000];
int order[210000];
unsigned long long ad[210000];
multiset<unsigned long long> allt;
int curcnt;
int ans, ani;
int dfs(int v, int p) {
  int tam = 1;
  for (int e : adj[v]) {
    int dest;
    if (e >= n - 1)
      dest = edges[e - (n - 1)].first;
    else
      dest = edges[e].second;
    if (dest != p) {
      size[e] = dfs(dest, v);
      tam += size[e];
    }
  }
  return tam;
}
unsigned long long get_seq(int e) {
  int v, rev;
  if (e >= (n - 1)) {
    v = edges[e - (n - 1)].first;
    rev = e - (n - 1);
  } else {
    v = edges[e].second;
    rev = e + (n - 1);
  }
  return ad[v] - t[rev];
}
bool comps(int a, int b) { return size[a] < size[b]; }
void add(unsigned long long t) {
  if (allt.find(t) == allt.end()) curcnt++;
  allt.insert(t);
}
void rem(unsigned long long t) {
  allt.erase(allt.find(t));
  if (allt.find(t) == allt.end()) curcnt--;
}
void odfs(int v, int p) {
  for (int e : adj[v]) {
    int dest;
    if (e >= n - 1)
      dest = edges[e - (n - 1)].first;
    else
      dest = edges[e].second;
    if (dest != p) {
      add(t[e]);
      odfs(dest, v);
    }
  }
}
void ddfs(int v, int p) {
  if (curcnt > ans) {
    ans = curcnt;
    ani = v;
  }
  for (int e : adj[v]) {
    int dest, ote;
    if (e >= n - 1) {
      dest = edges[e - (n - 1)].first;
      ote = e - (n - 1);
    } else {
      dest = edges[e].second;
      ote = e + (n - 1);
    }
    if (dest != p) {
      rem(t[e]);
      add(t[ote]);
      ddfs(dest, v);
      rem(t[ote]);
      add(t[e]);
    }
  }
}
void solve() {
  mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
  uniform_int_distribution<unsigned long long> dist;
  memset(size, -1, sizeof(size));
  scanf("%d", &n);
  for (int i = 0; i < n - 1; i++) {
    scanf("%d %d", &a, &b);
    a--;
    b--;
    edges.push_back({a, b});
    adj[a].push_back(i);
    adj[b].push_back((n - 1) + i);
  }
  dfs(0, -1);
  for (int i = 0; i < n - 1; i++) {
    if (size[i] == -1)
      size[i] = n - size[(n - 1) + i];
    else
      size[(n - 1) + i] = n - size[i];
  }
  for (int i = 0; i < 2 * (n - 1); i++) {
    order[i] = i;
  }
  sort(order, order + 2 * (n - 1), comps);
  int cur = 0;
  while (cur < 2 * (n - 1)) {
    int st = cur;
    int th = size[order[cur]];
    while (cur < 2 * (n - 1) && size[order[cur]] == th) cur++;
    vector<pair<unsigned long long, int> > seqs;
    for (int k = st; k < cur; k++) {
      seqs.push_back(make_pair(get_seq(order[k]), order[k]));
    }
    sort(seqs.begin(), seqs.end());
    unsigned long long cur_t = 0;
    for (int k = 0; k < seqs.size(); k++) {
      if (k == 0 || seqs[k].first != seqs[k - 1].first) {
        cur_t = dist(rng);
      }
      t[seqs[k].second] = cur_t;
      int e = seqs[k].second, p;
      if (e >= (n - 1))
        p = edges[e - (n - 1)].second;
      else
        p = edges[e].first;
      ad[p] += t[e];
    }
  }
  odfs(0, -1);
  ddfs(0, -1);
  ps(ani + 1);
}
int main() { solve(); }
void pr(int x) { printf("%d", x); }
void pr(const char* x) { printf("%s", x); }
void ps() { pr("\n"); }
template <class T, class... Ts>
void ps(const T& t, const Ts&... ts) {
  pr(t);
  if (sizeof...(ts)) pr(" ");
  ps(ts...);
}
