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;
int n;
vector<int> v[100002];
const int h_num = 2;
long long int B[] = {1011235817, 1011235817, 1011235817, 987654347, 1011235817,
                     1021328611, 987654347,  1011235817, 1000000007};
struct HASH {
  vector<long long int> val;
  bool emp;
  HASH(int v_ = 0) {
    val.assign(h_num, 0);
    emp = false;
    for (int i = 0; i < h_num; i++) {
      val[i] = v_;
    }
  }
  vector<long long int> get() { return val; }
};
HASH R[100002];
HASH operator*(const HASH &a, const HASH &b) {
  if (a.emp) {
    return b;
  }
  if (b.emp) {
    return a;
  }
  HASH r;
  for (int i = 0; i < h_num; i++) {
    r.val[i] = a.val[i] * b.val[i];
    if (r.val[i] >= B[i]) r.val[i] %= B[i];
  }
  return r;
}
HASH operator+(const HASH &a, HASH &b) {
  if (a.emp) {
    return a;
  }
  if (b.emp) {
    return b;
  }
  HASH r;
  for (int i = 0; i < h_num; i++) {
    r.val[i] = a.val[i] + b.val[i];
    if (r.val[i] >= B[i]) {
      r.val[i] %= B[i];
    }
  }
  return r;
}
HASH h[100002];
map<vector<long long int>, int> tmp;
int dep[100002];
inline void dfs(int b, int pr = -1) {
  vector<HASH> vv;
  for (int i = 0; i < v[b].size(); i++) {
    if (pr != v[b][i]) {
      dfs(v[b][i], b);
      dep[b] = max(dep[b], dep[v[b][i]] + 1);
    }
  }
  for (int i = 0; i < v[b].size(); i++) {
    if (pr != v[b][i]) {
      vv.push_back(h[v[b][i]] + R[dep[b]]);
    }
  }
  if (vv.size() == 0) {
    h[b] = HASH(1);
    return;
  }
  HASH sum = vv[0];
  for (int i = 1; i < vv.size(); i++) {
    sum = sum * vv[i];
  }
  h[b] = sum;
  return;
}
int maxt;
int idd;
inline void dfs2(int b, int pr, map<vector<long long int>, int> &mp, HASH par2,
                 int par_dep) {
  par_dep++;
  mp[h[b].get()]--;
  if (mp[h[b].get()] == 0) {
    mp.erase(h[b].get());
  }
  vector<HASH> vv[2];
  vector<HASH> im1[2];
  vector<HASH> im2[2];
  vector<int> H;
  H.push_back(par_dep);
  for (int i = 0; i < v[b].size(); i++) {
    if (v[b][i] != pr) {
      H.push_back(dep[v[b][i]] + 1);
    }
  }
  sort(H.begin(), H.end(), greater<int>());
  if (H.size() == 1) {
    H.push_back(H.back());
  }
  for (int i = 0; i < v[b].size(); i++) {
    if (v[b][i] != pr) {
      for (int j = 0; j < 2; j++) {
        vv[j].push_back(h[v[b][i]] + R[H[j]]);
      }
    }
  }
  for (int j = 0; j < 2; j++) {
    im1[j] = im2[j] = vv[j];
  }
  for (int j = 0; j < 2; j++) {
    for (int i = 1; i < im1[j].size(); i++) {
      im1[j][i] = im1[j][i] * im1[j][i - 1];
    }
    for (int i = (int)(im2[j].size()) - 2; i >= 0; i--) {
      im2[j][i] = im2[j][i] * im2[j][i + 1];
    }
  }
  HASH par[2];
  par[0] = par2 + R[H[0]];
  par[1] = par2 + R[H[1]];
  HASH cur[2];
  cur[0] = par[0];
  cur[1] = par[1];
  for (int j = 0; j < 2; j++) {
    if (im1[j].size()) {
      cur[j] = cur[j] * im1[j].back();
    }
  }
  mp[cur[0].get()]++;
  if (maxt < mp.size()) {
    maxt = mp.size();
    idd = b;
  }
  if (maxt == mp.size()) {
    idd = min(idd, b);
  }
  mp[cur[0].get()]--;
  if (mp[cur[0].get()] == 0) {
    mp.erase(cur[0].get());
  }
  int id = -1;
  for (int i = 0; i < v[b].size(); i++) {
    if (v[b][i] == pr) continue;
    id++;
    HASH go;
    go.emp = true;
    int flag = 0;
    if (H[0] == dep[v[b][i]] + 1) {
      flag++;
    }
    if (id) {
      go = go * im1[flag][id - 1];
    }
    if (id + 1 < im2[flag].size()) {
      go = go * im2[flag][id + 1];
    }
    go = go * par[flag];
    if (go.emp == true) {
      go = HASH(1);
    }
    mp[go.get()]++;
    dfs2(v[b][i], b, mp, go, H[flag]);
    mp[go.get()]--;
    if (mp[go.get()] == 0LL) {
      mp.erase(go.get());
    }
  }
  mp[h[b].get()]++;
}
bool use[5000000];
vector<int> pr;
int main() {
  for (int i = 2; i < 5000000; i++) {
    if (use[i] == false) {
      for (int j = i * 2; j < 5000000; j += i) {
        use[j] = true;
      }
      pr.push_back(i);
    }
  }
  cin >> n;
  if (n == 1) {
    cout << 1 << endl;
    return 0;
  }
  for (int i = 0; i < 100002; i++) {
    for (int j = 0; j < h_num; j++) {
      R[i].val[j] = pr[rand() % pr.size()];
    }
  }
  for (int i = 1; i < n; i++) {
    int a, b;
    scanf("%d%d", &a, &b);
    a--;
    b--;
    v[a].push_back(b);
    v[b].push_back(a);
  }
  int root = 0;
  dfs(root);
  for (int i = 0; i < n; i++) {
    tmp[h[i].get()]++;
  }
  HASH f;
  f.emp = true;
  dfs2(root, -1, tmp, f, -1);
  cout << idd + 1 << endl;
  return 0;
}
