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];
long long int B[2] = {1000000007, 1000000009};
int RR[2] = {109, 107};
const int h_num = 2;
struct HASH {
  long long int val[h_num];
  bool emp;
  HASH(int v_ = 0) {
    emp = false;
    for (int i = 0; i < h_num; i++) {
      val[i] = v_;
    }
  }
  HASH(int ar[]) {
    emp = false;
    for (int i = 0; i < h_num; i++) {
      val[i] = ar[i];
    }
  }
  pair<long long int, long long int> get() { return make_pair(val[0], val[1]); }
};
HASH R(RR);
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<pair<long long int, long long int>, int> tmp;
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);
      vv.push_back(h[v[b][i]] + R);
    }
  }
  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<pair<long long int, long long int>, int> &mp, HASH par) {
  mp[h[b].get()]--;
  if (mp[h[b].get()] == 0) {
    mp.erase(h[b].get());
  }
  vector<HASH> vv;
  vector<HASH> im1;
  vector<HASH> im2;
  par = par + R;
  for (int i = 0; i < v[b].size(); i++) {
    if (v[b][i] != pr) {
      vv.push_back(h[v[b][i]] + R);
    }
  }
  im1 = im2 = vv;
  for (int i = 1; i < im1.size(); i++) {
    im1[i] = im1[i] * im1[i - 1];
  }
  for (int i = (int)(im2.size()) - 2; i >= 0; i--) {
    im2[i] = im2[i] * im2[i + 1];
  }
  HASH cur = par;
  if (im1.size()) {
    cur = cur * im1.back();
  }
  mp[cur.get()]++;
  if (maxt < mp.size()) {
    maxt = mp.size();
    idd = b;
  }
  mp[cur.get()]--;
  if (mp[cur.get()] == 0) {
    mp.erase(cur.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;
    if (id) {
      go = go * im1[id - 1];
    }
    if (id + 1 < im2.size()) {
      go = go * im2[id + 1];
    }
    go = go * par;
    if (go.emp == true) {
      go = HASH(1);
    }
    mp[go.get()]++;
    dfs2(v[b][i], b, mp, go);
    mp[go.get()]--;
    if (mp[go.get()] == 0LL) {
      mp.erase(go.get());
    }
  }
  mp[h[b].get()]++;
}
int main() {
  cin >> n;
  if (n == 1) {
    cout << 1 << endl;
    return 0;
  }
  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);
  }
  dfs(0);
  for (int i = 0; i < n; i++) {
    tmp[h[i].get()]++;
  }
  HASH f;
  f.emp = true;
  dfs2(0, -1, tmp, f);
  cout << idd + 1 << endl;
  return 0;
}
