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 N = 1000 * 100 + 10;
const int MOD = 1000 * 1000 * 1000 + 7;
const int POD = 983;
vector<int> Graf[N];
long long SubtreeHash[N];
long long Pot[N];
int Size[N];
map<long long, int> Rozne;
int diff;
pair<int, int> result;
void Wczytaj(int &n) {
  int i, v, u;
  scanf("%d", &n);
  for (i = 0; i < n - 1; i++) {
    scanf("%d%d", &v, &u);
    Graf[v].push_back(u);
    Graf[u].push_back(v);
  }
  Pot[0] = 1;
  for (i = 1; i < N; i++) Pot[i] = (Pot[i - 1] * POD) % MOD;
}
long long DFSInicjuj(int v, int ojciec) {
  int i, suma;
  long long aktualny_hasz;
  vector<pair<long long, pair<int, int> > > Hasze;
  Size[v] = 1;
  Hasze.push_back(make_pair((long long)'(', make_pair(1, -1)));
  for (i = 0; i < Graf[v].size(); i++) {
    if (Graf[v][i] != ojciec) {
      SubtreeHash[Graf[v][i]] = DFSInicjuj(Graf[v][i], v);
      Hasze.push_back(make_pair(SubtreeHash[Graf[v][i]],
                                make_pair(2 * Size[Graf[v][i]], Graf[v][i])));
      Size[v] += Size[Graf[v][i]];
    }
  }
  Hasze.push_back(make_pair((long long)')', make_pair(1, -1)));
  sort(Hasze.begin() + 1, Hasze.end() - 1);
  aktualny_hasz = 0;
  suma = 0;
  for (i = 0; i < Hasze.size(); i++) {
    aktualny_hasz = (aktualny_hasz + Pot[suma] * Hasze[i].first) % MOD;
    suma += Hasze[i].second.first;
  }
  return aktualny_hasz;
}
void Update(int v, long long nowy, long long stary) {
  Rozne[stary]--;
  if (Rozne[stary] == 0) diff--;
  Rozne[nowy]++;
  if (Rozne[nowy] == 1) diff++;
  result = max(result, make_pair(diff, v));
}
void DFSPopraw(int v, int ojciec, long long upper_hash, int n) {
  int i, suma;
  long long aktualny_hasz, new_upper;
  vector<int> Suma_Pref;
  vector<long long> DiffHasze, Hasze_Pref;
  vector<pair<long long, pair<int, int> > > Hasze;
  Hasze.push_back(make_pair((long long)'(', make_pair(1, -1)));
  for (i = 0; i < Graf[v].size(); i++) {
    if (Graf[v][i] != ojciec) {
      Hasze.push_back(make_pair(SubtreeHash[Graf[v][i]],
                                make_pair(2 * Size[Graf[v][i]], Graf[v][i])));
      DiffHasze.push_back(SubtreeHash[Graf[v][i]]);
    }
  }
  if (upper_hash != -1) {
    DiffHasze.push_back(upper_hash);
    Hasze.push_back(
        make_pair(upper_hash, make_pair(2 * (n - Size[v]), ojciec)));
  }
  Hasze.push_back(make_pair((long long)')', make_pair(1, -1)));
  sort(Hasze.begin() + 1, Hasze.end() - 1);
  Hasze_Pref.push_back(0);
  Suma_Pref.push_back(0);
  suma = 0;
  for (i = 0; i < Hasze.size(); i++) {
    Hasze_Pref.push_back((Hasze_Pref.back() + Pot[suma] * Hasze[i].first) %
                         MOD);
    suma += Hasze[i].second.first;
    Suma_Pref.push_back(suma);
  }
  aktualny_hasz = Hasze.back().first;
  for (i = Hasze.size() - 2; i >= 1; i--) {
    new_upper = (Hasze_Pref[i] + Pot[Suma_Pref[i]] * aktualny_hasz) % MOD;
    if (Hasze[i].second.second != ojciec) {
      Update(Hasze[i].second.second, new_upper,
             SubtreeHash[Hasze[i].second.second]);
      DFSPopraw(Hasze[i].second.second, v, new_upper, n);
      Update(v, SubtreeHash[Hasze[i].second.second], new_upper);
    }
    aktualny_hasz =
        (aktualny_hasz * Pot[Hasze[i].second.first] + Hasze[i].first) % MOD;
  }
}
int main() {
  int n, i;
  Wczytaj(n);
  SubtreeHash[1] = DFSInicjuj(1, 1);
  for (i = 2; i <= n; i++) {
    Rozne[SubtreeHash[i]]++;
    if (Rozne[SubtreeHash[i]] == 1) diff++;
  }
  result = make_pair(diff, 1);
  DFSPopraw(1, 1, -1, n);
  printf("%d\n", result.second);
  return 0;
}
