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

/// Zengy Manga
#pragma GCC optimize("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("avx,avx2,fma")
using namespace std;

#include "bits/stdc++.h"
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/rope>

using namespace __gnu_pbds;
using namespace __gnu_cxx;

using ll = long long;
using ii = pair<int, int>;

template<typename T>
using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define pb push_back
#define F first
#define S second
#define f(i, a, b)  for(int i = a; i < b; i++)
#define all(a)  a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define sz(x) (int)(x).size()
#define mp make_pair
#define popCnt(x) (__builtin_popcountll(x))

const int N = 1e5+5, LG = log2(N) + 1, MOD = 1e9 + 7;
const double PI = acos(-1);
///We hash a frequnecy array
const int MOD1 = 1e9 + 7;
const int MOD2 = 1e9 + 9;
const int BASE1 = 1e6 + 1;
const int BASE2 = 1e6 + 3;

vector<int> adj[100005];
int val1D[100005];
int val2D[100005];
int val1U[100005];
int val2U[100005];
int val1R[100005];
int val2R[100005];
int val1HD[100005];
int val2HD[100005];
int val1HR[100005];
int val2HR[100005];
map<int, int> val_dict[2];  ///number of hashers
int pwr1[N * 2];
int pwr2[N * 2];

int get(map<int, int> & val_dict, int hash) {

    if(val_dict.count(hash) == 0) {
        int x = val_dict.size();
        val_dict[hash] = x;
    }

    return val_dict[hash];

}
///I need to find in my subtree the set of values
///you need to find the root with maximum size of set
void downward_dfs(int node, int parent) {

    ll hash1 = 0;
    ll hash2 = 0;

    for(auto child : adj[node]) if(child != parent){

        downward_dfs(child, node);
        hash1 += pwr1[val1D[child]];    ///I have both hashes
        hash2 += pwr2[val2D[child]];

    }

    hash1 %= MOD1;
    hash2 %= MOD2;

    val1HD[node] = hash1;
    val2HD[node] = hash2;
    val1D[node] = get(val_dict[0], hash1);
    val2D[node] = get(val_dict[1], hash2);

}
map<ii, int> subtrees;
int curCnt = 0;
pair<int, int> ans;
void add(int hash1, int hash2) {
    curCnt -= subtrees[ii(hash1, hash2)] >= 1;
    subtrees[ii(hash1,hash2)] += 1;
    curCnt += subtrees[ii(hash1, hash2)] >= 1;
}
void del(int hash1, int hash2) {
    curCnt -= subtrees[ii(hash1, hash2)] >= 1;
    subtrees[ii(hash1,hash2)] -= 1;
    curCnt += subtrees[ii(hash1, hash2)] >= 1;
}
void upward_dfs(int node, int parent) {

    ans = max(ans, ii(curCnt, -node));

    del(val1R[node], val2R[node]);
    for(auto child : adj[node])
    if(child != parent) {   ///update the values
        del(val1D[child], val2D[child]);    ///calculate my upward value and his root value

        val1U[node] = get(val_dict[0], (val1HR[node] + MOD1 - pwr1[val1D[child]]) % MOD1);
        val2U[node] = get(val_dict[1], (val2HR[node] + MOD2 - pwr2[val2D[child]]) % MOD2);

        val1HR[child] = (val1HD[child] + pwr1[val1U[node]]) % MOD1;
        val1HR[child] = (val2HD[child] + pwr2[val2U[node]]) % MOD2;

        val1R[child] = get(val_dict[0], val1HR[child]);
        val2R[child] = get(val_dict[1], val2HR[child]);

        add(val1U[node], val2U[node]);
        add(val1R[child], val2R[child]);

        upward_dfs(child, node);

        del(val1U[node], val2U[node]);
        del(val1R[child], val2R[child]);

        add(val1D[child], val2D[child]);
    }
    add(val1R[node], val2R[node]);
}
void doWork() {

    int n;
    cin >> n;
    for(int i = 1; i < n; i++) {
        int u, v;
        cin >> u >> v;
        adj[u].pb(v);
        adj[v].pb(u);
    }

    ///initialzie
    pwr1[0] = pwr2[0] = 1;
    for(int i = 1; i < N * 2; i++) {
        pwr1[i] = 1ll * pwr1[i-1] * BASE1 % MOD1;
        pwr2[i] = 1ll * pwr2[i-1] * BASE2 % MOD2;
    }

    downward_dfs(1, 1);

    ans = ii(0, 0);

    ///calculate the answer for root 1
    for(int i = 1; i <= n; i++) {
        add(val1D[i], val2D[i]);
    }

    val1R[1] = val1D[1];
    val2R[1] = val2D[1];
    val1HR[1] = val1HD[1];
    val2HR[1] = val2HD[1];
    upward_dfs(1, 1);

    cerr << ans.F << '\n';
    cout << -ans.S << '\n';

}
int32_t main() {
#ifdef ONLINE_JUDGE
    ios_base::sync_with_stdio(0);
    cin.tie(0);
#endif // ONLINE_JUDGE

    int t = 1;
//    cin >> t;
    while (t--) {
        doWork();
    }


    return 0;
}
