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>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/trie_policy.hpp>
#include <ext/rope>

#pragma 03

using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

#define fi first
#define se second
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define gcd __gcd
#define fastio ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define rep(i, n) for (int i=0; i<(n); i++)
#define rep1(i, n) for (int i=1; i<=(n); i++)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define endl "\n"

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned uint;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;
template<typename _def> using ordered_set=tree<_def, null_type, less<_def>, rb_tree_tag, tree_order_statistics_node_update>;
typedef trie<string, null_type, trie_string_access_traits<>, pat_trie_tag, trie_prefix_search_node_update> pref_trie;

struct custom_hashes {
    inline static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    template<typename T> //should take care of all types that can turn into integers
    size_t operator()(T x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64((uint64_t)x + FIXED_RANDOM);
    }

    template<typename T1, typename T2>
    size_t operator()(pair<T1, T2> x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(hash<T1>()(x.fi) + FIXED_RANDOM) ^ splitmix64(hash<T2>()(x.se) + FIXED_RANDOM);
    }
};

template<typename _F, typename _T> using safe_map=gp_hash_table<_F, _T, custom_hashes>;

vvi adj;
int n;
int root;

safe_map<int, int> hashes;
safe_map<pii, int> label;
safe_map<int, int> rmap;
vi pw{1};

constexpr int p=31, MOD=1e9+123;

inline int get_hash(const vi& a) {
    int ans=0;
    for(int it: a) (ans+=pw[it])%=MOD;
    return ans;
}

struct tracker {
    safe_map<int, int> m;
    void add(int x) {m[x]++;}
    void sub(int x) {if(m.find(x)==m.end()) return; if(m[x]>1) m[x]--; else m.erase(x);}
    const size_t size() {return m.size();}
} labels;

int t=0;
int get_label(int u, int par, bool ins=0) {
    if(label.find({u, par})!=label.end()) return label[{u, par}];
    vi sons;
    for(int v: adj[u]) if(v!=par) sons.pb(get_label(v, u, ins));
    int val=get_hash(sons);
    if(hashes.find(val)!=hashes.end()) label[{u, par}]=hashes[val];
    else {
        pw.pb(1LL*pw.back()*p%MOD);
        hashes[val]=t++;
        rmap[t]=val;
        label[{u, par}]=hashes[val];
    }
    if(ins) {
        labels.add(label[{u, par}]);
    }
    return label[{u, par}];
}

void fill_labels(int u, int par) {
    for(int v: adj[u]) if(v!=par){
        if(u==root) {
            int val=rmap[label[{u, -1}]]-pw[label[{v, u}]]%MOD+MOD%MOD;
            if(hashes.find(val)!=hashes.end()) label[{u, v}]=hashes[val];
            else {
                pw.pb(1LL*pw.back()*p%MOD);
                hashes[val]=t++;
                rmap[t]=val;
                label[{u, v}]=hashes[val];
            }
        }
        else {
            int val=rmap[label[{u, par}]]-pw[label[{v, u}]]+0LL+rmap[label[{par, u}]]%MOD+MOD%MOD;
            if(hashes.find(val)!=hashes.end()) label[{u, v}]=hashes[val];
            else {
                pw.pb(1LL*pw.back()*p%MOD);
                hashes[val]=t++;
                rmap[t]=val;
                label[{u, v}]=hashes[val];
            }
        }
    }
    for(int v: adj[u]) if(v!=par) fill_labels(v, u);
}

int mx, id;

void dfs(int u, int par=-1) {
    if(u!=root) {
        labels.sub(get_label(u, par));
        labels.add(get_label(par, u));
        if(mx<labels.size()) mx=labels.size(), id=u;
    }
    for(int v: adj[u]) if(v!=par) dfs(v, u);
    if(u!=root) {
        labels.add(get_label(u, par));
        labels.sub(get_label(par, u));
    }
}

int get_max() {
    rep(i, n) if(adj[i].size()>adj[root].size()) root=i;
    get_label(root, -1, 1);
    fill_labels(root, -1);
    labels.sub(get_label(root, -1));
    mx=labels.size(); id=root;
    dfs(root);
    return id;
}

int32_t main() {
    //fixed up the formatting and the algorithm
    //I haven't been able to prove if the last algorithm is O(n) or not
    //but this one is definitely O(n)
    //as for correctness I think this is correct; idk if actually correct though
    //we'll see
    fastio;
    cin>>n; adj.resize(n);
    rep(i, n-1) {
        int u, v; cin>>u>>v;
        adj[--u].pb(--v); adj[v].pb(u);
    }
    cout<<get_max()+1<<endl;
}
