#include <bits/stdc++.h>
int father = 0;
using namespace std;
const int oo = 1e9;
const int M1 = 1000000007;
const int M2 = 1000000009;
const double PI = acos(-1);
const int SZ = 1 << 21;
const int MX = 300000;
const int N = MX + 100;
const int BASE = 3;
int n, a, b, sz[N];
long long pw[N], pw2[N];
pair<int, int> dp[N];
vector<int> g[MX];
map<pair<int, int>, int> freq;
int res = 0, ans = -1, idx = -1;
void add(int &hash, int &len, int toAdd, int newLen, int MOD) {
  hash = (1ll * hash + 1ll * (MOD == M1 ? pw[len] : pw2[len]) * toAdd) % MOD;
  len += newLen;
}
void merge(pair<pair<int, int>, int> &f, pair<pair<int, int>, int> s) {
  int len = f.second;
  add(f.first.first, f.second, s.first.first, s.second, M1);
  f.second = len;
  add(f.first.second, f.second, s.first.second, s.second, M2);
}
void addH(pair<int, int> hash) {
  if (freq[hash] == 0) res++;
  freq[hash]++;
}
void remH(pair<int, int> hash) {
  freq[hash]--;
  if (freq[hash] == 0) res--;
}
pair<int, int> pre(int u, int p) {
  if (dp[u].first != -1) return dp[u];
  vector<pair<pair<int, int>, int> > all;
  sz[u] = 1;
  for (int i = 0; i < g[u].size(); ++i) {
    int v = g[u][i];
    if (v == p) continue;
    pair<int, int> hs = pre(v, u);
    all.push_back(make_pair(hs, 2 * sz[v]));
    sz[u] += sz[v];
  }
  sort(all.begin(), all.end());
  int h1 = 1, l1 = 1, l2 = 1, h2 = 1;
  for (int i = 0; i < all.size(); ++i) {
    add(h1, l1, all[i].first.first, all[i].second, M1);
    add(h2, l2, all[i].first.second, all[i].second, M2);
  }
  add(h1, l1, 2, 1, M1);
  add(h2, l2, 2, 1, M2);
  addH(make_pair(h1, h2));
  return dp[u] = make_pair(h1, h2);
}
void solve(int u, int p, pair<int, int> parentHash) {
  vector<pair<pair<int, int>, int> > pr, sf;
  vector<pair<pair<pair<int, int>, int>, int> > all;
  for (int i = 0; i < g[u].size(); ++i) {
    int v = g[u][i];
    if (v == p) continue;
    all.push_back(make_pair(make_pair(pre(v, u), 2 * sz[v]), v));
  }
  if (p != -1)
    all.push_back(make_pair(make_pair(parentHash, 2 * (n - sz[u])), p));
  sort(all.begin(), all.end());
  for (int i = 0; i < all.size(); ++i) {
    pr.push_back(all[i].first);
    if (i) {
      pr[i] = pr[i - 1];
      merge(pr[i], all[i].first);
    }
  }
  sf.resize(all.size());
  for (int i = (int)all.size() - 1; i >= 0; --i) {
    sf[i] = all[i].first;
    if (i + 1 < all.size()) {
      merge(sf[i], sf[i + 1]);
    }
  }
  {
    pair<pair<int, int>, int> father = make_pair(make_pair(1, 1), 1);
    for (int i = 0; i < all.size(); ++i) {
      merge(father, all[i].first);
    }
    merge(father, make_pair(make_pair(2, 2), 1));
    remH(pre(u, p));
    addH(father.first);
    if (res > ans) {
      ans = res;
      idx = u;
    }
    remH(father.first);
    addH(pre(u, p));
  }
  remH(pre(u, p));
  for (int i = 0; i < all.size(); ++i) {
    int v = all[i].second;
    if (v == p) continue;
    pair<pair<int, int>, int> hash = make_pair(make_pair(1, 1), 1);
    if (i > 0) merge(hash, pr[i - 1]);
    if (i + 1 < all.size()) merge(hash, sf[i + 1]);
    merge(hash, make_pair(make_pair(2, 2), 1));
    addH(hash.first);
    solve(v, u, hash.first);
    remH(hash.first);
  }
  addH(pre(u, p));
}
int main() {
  memset(dp, -1, sizeof dp);
  scanf("%d", &n);
  for (int i = 0; i < n - 1; ++i) {
    scanf("%d%d", &a, &b);
    g[a].push_back(b);
    g[b].push_back(a);
  }
  pw[0] = pw2[0] = 1;
  for (int i = 1; i <= MX; ++i) {
    pw[i] = (BASE * pw[i - 1]) % M1;
    pw2[i] = (BASE * pw2[i - 1]) % M2;
  }
  pre(1, -1);
  solve(1, -1, make_pair(-1, -1));
  printf("%d\n", idx);
  return 0;
}
