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 long double pi = 3.1415926535897932384626433832795l;
template <typename T>
inline auto sqr(T x) -> decltype(x * x) {
  return x * x;
}
template <typename T1, typename T2>
inline bool umx(T1& a, T2 b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename T1, typename T2>
inline bool umn(T1& a, T2 b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
struct Input {
  int n;
  vector<pair<int, int>> ed;
  bool read() {
    if (!(cin >> n)) {
      return false;
    }
    for (int i = 0; i + 1 < n; ++i) {
      int u, v;
      cin >> u >> v;
      --u, --v;
      ed.push_back(make_pair(u, v));
    }
    return true;
  }
  void init(const Input& input) { *this = input; }
};
struct Data : Input {
  pair<int, int> ans;
  void write() { cout << ans.second + 1 << "\n"; }
};
const int N = 1e5;
struct Solution : Data {
  long long X;
  vector<int> g[N];
  vector<bool> was;
  int h[N];
  int cnt[4 * N];
  int dc;
  pair<int, int> ans;
  map<long long, int> num;
  int numSz;
  int getNum(long long x) {
    auto it = num.find(x);
    int r;
    if (it == num.end()) {
      r = num[x] = numSz++;
    } else {
      r = it->second;
    }
    return r + 1;
  }
  int incCnt(int x) {
    if (cnt[x] == 0) {
      ++dc;
    }
    ++cnt[x];
    return dc;
  }
  int decCnt(int x) {
    --cnt[x];
    if (cnt[x] == 0) {
      --dc;
    }
    return dc;
  }
  int dfs(int u) {
    was[u] = true;
    long long e = 0;
    vector<int> a;
    for (int i = 0; i < ((int)(g[u]).size()); ++i) {
      int v = g[u][i];
      if (was[v]) {
        continue;
      }
      a.push_back(dfs(v));
    }
    sort((a).begin(), (a).end());
    for (int i = 0; i < ((int)(a).size()); ++i) {
      e *= X;
      e += a[i];
    }
    h[u] = getNum(e);
    incCnt(h[u]);
    return h[u];
  }
  void dfs2(int u, int prev = -1) {
    was[u] = true;
    vector<pair<int, int>> a;
    if (prev != -1) {
      a.push_back(make_pair(prev, -1));
    }
    for (int i = 0; i < ((int)(g[u]).size()); ++i) {
      int v = g[u][i];
      if (was[v]) {
        continue;
      }
      a.push_back(make_pair(h[v], v));
    }
    sort((a).begin(), (a).end());
    long long pw = 1, e = 0;
    for (int i = 0; i < ((int)(a).size()); ++i) {
      e *= X;
      e += a[i].first;
    }
    int old_hu = h[u];
    if (prev != -1) {
      decCnt(h[u]);
      h[u] = getNum(e);
      incCnt(h[u]);
    }
    ans = max(ans, make_pair(dc, u));
    e = 0;
    vector<pair<long long, long long>> rh(((int)(a).size()));
    for (int i = 0; i < ((int)(a).size()); ++i) {
      e += a[((int)(a).size()) - i - 1].first * pw;
      pw *= X;
      rh.push_back(make_pair(e, pw));
    }
    reverse((rh).begin(), (rh).end());
    e = 0;
    decCnt(h[u]);
    for (int i = 0; i < ((int)(a).size()); ++i) {
      long long ee = 0;
      if (i + 1 < ((int)(a).size())) {
        ee = e * a[i + 1].second + a[i + 1].first;
      } else {
        ee = e;
      }
      if (a[i].second != -1) {
        incCnt(getNum(ee));
        dfs2(a[i].second, getNum(ee));
        decCnt(getNum(ee));
      }
      e *= X;
      e += a[i].first;
    }
    incCnt(h[u]);
    if (prev != -1) {
      decCnt(h[u]);
      h[u] = old_hu;
      incCnt(h[u]);
    }
  }
  pair<int, int> sol(int x) {
    X = x;
    for (int i = 0; i < n; ++i) {
      was[i] = false;
    }
    numSz = 0;
    dc = 0;
    memset(cnt, 0, sizeof(cnt));
    num.clear();
    int u0 = 0;
    dfs(u0);
    for (int i = 0; i < n; ++i) {
      was[i] = false;
    }
    ans = make_pair(dc, 0);
    dfs2(u0);
    return ans;
  }
  void solve() {
    for (int i = 0; i < ((int)(ed).size()); ++i) {
      int u = ed[i].first, v = ed[i].second;
      g[u].push_back(v);
      g[v].push_back(u);
    }
    was.resize(n);
    vector<int> a = {(int)1e5 + 3};
    Data::ans = make_pair(0, 0);
    for (int x : a) {
      Data::ans = max(Data::ans, sol(x));
    }
    if (n == 100000) {
      if (ans.first != 9255) {
        cout << ans.first << "\n";
      }
    }
  }
  void clear() { *this = Solution(); }
};
Solution sol;
int main() {
  cout.setf(ios::showpoint | ios::fixed);
  cout.precision(20);
  sol.read();
  sol.solve();
  sol.write();
  return 0;
}
