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 = 100000;
const long long BASE = 181;
const long long MOD = 1000000009;
vector<int> g[1 + MAXN];
vector<pair<int, int> > edges;
queue<int> Queue;
map<pair<int, int>, int> number;
vector<long long> add[1 + MAXN], subtract[1 + MAXN];
long long code[2 * MAXN], value[2 * MAXN];
int nodes[2 * MAXN];
int degree[1 + MAXN];
long long power[10 * MAXN];
int answer[1 + MAXN];
struct Son {
  long long code;
  int nodes;
  int index;
  bool operator<(const Son &other) const { return code < other.code; }
};
unordered_map<long long, int> seen;
void Initialize(int node, int father) {
  int i = 0;
  for (auto &son : g[node]) {
    if (son != father) {
      seen[add[node][i]]++;
      Initialize(son, node);
    }
    i++;
  }
}
void DFS(int node, int father) {
  answer[node] = seen.size();
  int i = 0;
  for (auto &son : g[node]) {
    if (son != father) {
      seen[add[node][i]]--;
      if (seen[add[node][i]] == 0) seen.erase(add[node][i]);
      seen[subtract[node][i]]++;
      DFS(son, node);
      seen[subtract[node][i]]--;
      if (seen[subtract[node][i]] == 0) seen.erase(subtract[node][i]);
      seen[add[node][i]]++;
    }
    i++;
  }
}
int main() {
  power[0] = 1;
  for (int i = 1; i < 10 * MAXN; i++) power[i] = (power[i - 1] * BASE) % MOD;
  int n;
  cin >> n;
  if (n == 1) {
    cout << "1\n";
    return 0;
  }
  for (int i = 1; i < n; i++) {
    int a, b;
    cin >> a >> b;
    g[a].push_back(b);
    g[b].push_back(a);
    edges.push_back(make_pair(a, b));
    edges.push_back(make_pair(b, a));
  }
  for (int i = 0; i < 2 * (n - 1); i++) number[edges[i]] = i;
  memset(code, -1, sizeof(code));
  memset(value, -1, sizeof(value));
  memset(nodes, -1, sizeof(nodes));
  for (int i = 1; i <= n; i++)
    if (g[i].size() == 1) {
      Queue.push(number[make_pair(g[i][0], i)]);
      nodes[number[make_pair(g[i][0], i)]] = 1;
      value[number[make_pair(g[i][0], i)]] = (73 * BASE + 97) % MOD;
    }
  while (!Queue.empty()) {
    int edge = Queue.front();
    Queue.pop();
    if (code[edge] != -1) continue;
    int node = edges[edge].first;
    degree[node]++;
    code[edge] = value[edge];
    if (degree[node] == g[node].size() - 1) {
      int dad;
      vector<Son> sons;
      int j = 0;
      for (auto &son : g[node]) {
        if (code[number[make_pair(node, son)]] == -1)
          dad = son;
        else
          sons.push_back({code[number[make_pair(node, son)]],
                          nodes[number[make_pair(node, son)]], j});
        j++;
      }
      sort(sons.begin(), sons.end());
      int current = number[make_pair(dad, node)];
      value[current] = 73;
      nodes[current] = 1;
      for (auto &son : sons) {
        value[current] = (value[current] * power[2 * son.nodes]) % MOD;
        value[current] = (value[current] + son.code) % MOD;
        nodes[current] += son.nodes;
      }
      value[current] = (value[current] * BASE + 97) % MOD;
      Queue.push(current);
    } else if (degree[node] == g[node].size()) {
      vector<Son> sons;
      int j = 0;
      for (auto &son : g[node]) {
        sons.push_back({code[number[make_pair(node, son)]],
                        nodes[number[make_pair(node, son)]], j});
        j++;
      }
      sort(sons.begin(), sons.end());
      vector<long long> preffix(sons.size() + 1, 0);
      preffix[0] = 73;
      preffix[1] = (73 * BASE + sons[0].code) % MOD;
      for (int i = 1; i <= sons.size(); i++)
        preffix[i] =
            (preffix[i - 1] * power[2 * sons[i - 1].nodes] + sons[i - 1].code) %
            MOD;
      preffix.push_back((preffix.back() * BASE + 97) % MOD);
      vector<long long> suffix(sons.size() + 2, 0);
      vector<int> suffixSize(sons.size() + 2, 0);
      suffix.back() = 97;
      for (int i = sons.size(); i > 0; i--) {
        suffix[i] = (suffix[i + 1] +
                     sons[i - 1].code * power[2 * suffixSize[i + 1] + 1]) %
                    MOD;
        suffixSize[i] = suffixSize[i + 1] + sons[i - 1].nodes;
      }
      suffix[0] = (suffix[1] + 73 * power[2 * suffixSize[1] + 1]) % MOD;
      suffixSize[0] = suffixSize[1];
      for (int i = 0; i < sons.size(); i++) {
        int son = g[node][sons[i].index];
        if (value[number[make_pair(son, node)]] == -1) {
          nodes[number[make_pair(son, node)]] =
              n - nodes[number[make_pair(node, son)]];
          value[number[make_pair(son, node)]] =
              (preffix[i] * power[2 * suffixSize[i + 2] + 1] + suffix[i + 2]) %
              MOD;
          Queue.push(number[make_pair(son, node)]);
        }
      }
    }
  }
  for (int i = 1; i <= n; i++)
    for (auto &son : g[i]) {
      add[i].push_back(code[number[make_pair(i, son)]]);
      subtract[i].push_back(code[number[make_pair(son, i)]]);
    }
  Initialize(1, 0);
  DFS(1, 0);
  int best = 0;
  for (int i = 1; i <= n; i++)
    if (answer[i] > answer[best]) best = i;
  cout << best << "\n";
  return 0;
}
