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;
class InputReader {
 public:
  InputReader() {
    input_file = stdin;
    cursor = 0;
    fread(buffer, SIZE, 1, input_file);
  }
  inline InputReader &operator>>(int &n) {
    while (buffer[cursor] < '0' || buffer[cursor] > '9') {
      advance();
    }
    n = 0;
    while ('0' <= buffer[cursor] && buffer[cursor] <= '9') {
      n = n * 10 + buffer[cursor] - '0';
      advance();
    }
    return *this;
  }

 private:
  FILE *input_file;
  static const int SIZE = 1 << 17;
  int cursor;
  char buffer[SIZE];
  inline void advance() {
    ++cursor;
    if (cursor == SIZE) {
      cursor = 0;
      fread(buffer, SIZE, 1, input_file);
    }
  }
};
const int NMAX = 200000 + 5;
int N;
int sz[NMAX];
vector<int> graph[NMAX];
const int MOD1 = 1000000000 + 7;
const int MOD2 = 1000000000 + 9;
const int C1 = 63;
const int C2 = 67;
int powC1[2 * NMAX];
int powC2[2 * NMAX];
pair<int, int> hs[NMAX];
bool cmp(const int &a, const int &b) { return hs[a] < hs[b]; }
int ans;
int nodeAns;
int current;
map<pair<int, int>, int> Map;
inline void addToMap(int node) {
  Map[hs[node]]++;
  if (Map[hs[node]] == 1) current++;
}
inline void removeFromMap(int node) {
  Map[hs[node]]--;
  if (Map[hs[node]] == 0) current--;
}
void computeDp(int node, int father) {
  hs[node] = {0, 0};
  sort(graph[node].begin(), graph[node].end(), cmp);
  for (auto it : graph[node])
    if (it != father) {
      hs[node].first =
          (1LL * powC1[2 * sz[it]] * hs[node].first + hs[it].first) % MOD1;
      hs[node].second =
          (1LL * powC2[2 * sz[it]] * hs[node].second + hs[it].second) % MOD2;
    }
  hs[node].first = (1LL * hs[node].first * C1 + 1) % MOD1;
  hs[node].second = (1LL * hs[node].second * C2 + 1) % MOD2;
}
void dfsInit(int node, int father) {
  sz[node] = 1;
  for (auto it : graph[node])
    if (it != father) {
      dfsInit(it, node);
      sz[node] += sz[it];
    }
  computeDp(node, father);
  addToMap(node);
}
void dfsMove(int node, int father) {
  if (current > ans) {
    ans = current;
    nodeAns = node;
  }
  vector<pair<int, int> > hPref(graph[node].size() + 2);
  hPref[0] = {0, 0};
  for (int i = 0; i < graph[node].size(); ++i) {
    hPref[i + 1].first = (1LL * powC1[2 * sz[graph[node][i]]] * hPref[i].first +
                          hs[graph[node][i]].first) %
                         MOD1;
    hPref[i + 1].second =
        (1LL * powC2[2 * sz[graph[node][i]]] * hPref[i].second +
         hs[graph[node][i]].second) %
        MOD2;
  }
  pair<int, int> hSuf = {0, 0};
  int szSuf = 0;
  for (int i = graph[node].size() - 1; i >= 0; --i) {
    if (graph[node][i] != father) {
      int oldSzNode = sz[node];
      int oldSzIt = sz[graph[node][i]];
      sz[node] -= sz[graph[node][i]];
      sz[graph[node][i]] = oldSzNode;
      pair<int, int> oldHsIt = hs[graph[node][i]];
      pair<int, int> oldHsNode = hs[node];
      removeFromMap(node);
      removeFromMap(graph[node][i]);
      hs[node].first =
          (1LL * hPref[i].first * powC1[szSuf] + hSuf.first) % MOD1;
      hs[node].second =
          (1LL * hPref[i].second * powC2[szSuf] + hSuf.second) % MOD2;
      hs[node].first = (1LL * hs[node].first * C1 + 1) % MOD1;
      hs[node].second = (1LL * hs[node].second * C2 + 1) % MOD2;
      computeDp(graph[node][i], 0);
      addToMap(node);
      addToMap(graph[node][i]);
      dfsMove(graph[node][i], node);
      removeFromMap(node);
      removeFromMap(graph[node][i]);
      hs[node] = oldHsNode;
      hs[graph[node][i]] = oldHsIt;
      addToMap(node);
      addToMap(graph[node][i]);
      sz[node] = oldSzNode;
      sz[graph[node][i]] = oldSzIt;
    }
    hSuf.first =
        (1LL * powC1[szSuf] * hSuf.first + hs[graph[node][i]].first) % MOD1;
    hSuf.second =
        (1LL * powC2[szSuf] * hSuf.second + hs[graph[node][i]].second) % MOD2;
    szSuf += 2 * sz[graph[node][i]];
  }
}
int main() {
  InputReader cin;
  cin >> N;
  powC1[0] = powC2[0] = 1;
  for (int i = 1; i <= 2 * N; ++i) {
    powC1[i] = (1LL * C1 * powC1[i - 1]) % MOD1;
    powC2[i] = (1LL * C2 * powC2[i - 1]) % MOD2;
  }
  for (int i = 1; i < N; ++i) {
    int a, b;
    cin >> a >> b;
    graph[a].push_back(b);
    graph[b].push_back(a);
  }
  dfsInit(1, 0);
  ans = current;
  nodeAns = 1;
  dfsMove(1, 0);
  cout << nodeAns << '\n';
  return 0;
}
