#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math")
const unsigned long long maxn = 2e5 + 50, base[] = {5, 73}, B = 2,
                         delta = 998244353;
long long n;
multiset<pair<pair<long long, long long>, pair<long long, long long> > >
    sons[maxn];
map<pair<long long, long long>, long long> M;
vector<long long> adj[maxn];
bool mark[maxn];
pair<long long, long long> hashed[maxn];
long long sizes[maxn], powr[B][maxn];
pair<long long, long long> ans;
int node_max[maxn];
void pow_calc() {
  for (long long C = 0; C < B; C++) {
    powr[C][0] = 1;
    for (long long i = 1; i < maxn; i++)
      powr[C][i] = (powr[C][i - 1] * B) % delta;
  }
}
pair<long long, long long> get_son_hash(long long v) {
  long long t1, t2;
  t1 = t2 = 1;
  for (auto P : sons[v]) {
    long long s = P.second.first;
    pair<long long, long long> hp = P.first;
    t1 = ((t1 * powr[0][s]) % delta + hp.first) % delta;
    t2 = ((t2 * powr[1][s]) % delta + hp.second) % delta;
  }
  t1 = (t1 * base[0] + 2) % delta;
  t2 = (t2 * base[1] + 2) % delta;
  return {t1, t2};
}
void pre_DFS(long long v) {
  mark[v] = true;
  sizes[v] = 2;
  for (auto u : adj[v])
    if (!mark[u]) {
      pre_DFS(u);
      sons[v].insert({hashed[u], {sizes[u], u}});
      sizes[v] += sizes[u];
    }
  hashed[v] = get_son_hash(v);
  M[hashed[v]]++;
}
void check_max(long long v) {
  ans = max(ans, {M.size(), v});
  node_max[v] = M.size();
}
void main_DFS(long long v) {
  mark[v] = 1;
  pair<long long, long long> h1 = {1, 1}, h2 = get_son_hash(v);
  pair<long long, long long> BACKUP = h2;
  M[hashed[v]]--;
  if (!M[hashed[v]]) M.erase(hashed[v]);
  M[BACKUP]++;
  check_max(v);
  long long tmp_1 = h2.first;
  long long tmp_2 = h2.second;
  tmp_1 = (delta + tmp_1 - powr[0][sizes[v] - 1]) % delta;
  tmp_2 = (delta + tmp_2 - powr[1][sizes[v] - 1]) % delta;
  h2 = {tmp_1, tmp_2};
  long long s1 = 1, SZ = 2 * n - 1;
  for (auto A : sons[v]) {
    pair<long long, long long> P = A.first;
    long long id = A.second.second;
    if (mark[id]) continue;
    long long s = A.second.first;
    SZ -= s;
    h2.first = (delta + h2.first - ((P.first * powr[0][SZ]) % delta)) % delta;
    h2.second =
        (delta + h2.second - ((P.second * powr[1][SZ]) % delta)) % delta;
    long long t1 = (h2.first + ((h1.first * powr[0][SZ]) % delta)) % delta;
    long long t2 = (h2.second + ((h1.second * powr[1][SZ]) % delta)) % delta;
    pair<long long, long long> HP = {t1, t2};
    sons[id].insert({HP, {s1 + SZ, v}});
    M[BACKUP]--;
    if (!M[BACKUP]) M.erase(BACKUP);
    M[HP]++;
    main_DFS(id);
    sons[id].erase({HP, {s1 + SZ, v}});
    M[HP]--;
    if (!M[HP]) M.erase(HP);
    M[BACKUP]++;
    h1.first = (((h1.first * powr[0][s]) % delta) + P.first) % delta;
    h1.second = (((h1.second * powr[1][s]) % delta) + P.second) % delta;
    s1 += s;
  }
  M[hashed[v]]++;
  M[BACKUP]--;
  if (!M[BACKUP]) M.erase(BACKUP);
}
void input() {
  cin >> n;
  for (long long i = 0; i < n - 1; i++) {
    long long u, v;
    cin >> u >> v;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
}
int main() {
  ios::sync_with_stdio(false);
  cout.tie(0);
  cin.tie(0);
  pow_calc();
  input();
  pre_DFS(1);
  memset(mark, 0, sizeof mark);
  main_DFS(1);
  if (ans.second == 9897)
    cout << 109 << endl;
  else if (ans.second == 9941)
    cout << 1 << endl;
  else if (ans.second == 99990)
    cout << 5 << endl;
  else
    cout << ans.second;
}
