#include <bits/stdc++.h>
using namespace std;
const int MAXN = (1 << 18);
const int64_t mod = (int64_t)1e9 + 7;
const int64_t base = (int64_t)3;
int64_t pw[MAXN];
struct implicit_treap {
  struct node {
    int sz, prior;
    int64_t val, hsh, vlen, len;
    node *l, *r;
    node() {
      sz = 0;
      val = 0;
      len = 0;
      vlen = 0;
      hsh = 0;
      prior = 0;
      l = nullptr;
      r = nullptr;
    }
    node(int64_t _val, int _vlen) {
      val = _val;
      vlen = _vlen;
      len = _vlen;
      hsh = val;
      sz = 1;
      prior = rand();
      l = nullptr;
      r = nullptr;
    }
  };
  typedef node *pnode;
  int size(pnode v) { return v ? v->sz : 0; }
  void update_size(pnode &v) {
    if (v) v->sz = size(v->l) + size(v->r) + 1;
  }
  void reset(pnode &v) {
    if (v) v->hsh = v->val, v->len = v->vlen;
  }
  void combine(pnode &v, pnode l, pnode r) {
    if (!l) {
      v = r;
      return;
    }
    if (!r) {
      v = l;
      return;
    }
    v->hsh = (l->hsh * pw[r->len] + r->hsh) % mod;
    v->len = l->len + r->len;
  }
  void operation(pnode &v) {
    if (!v) return;
    reset(v);
    combine(v, v->l, v);
    combine(v, v, v->r);
  }
  void merge(pnode &t, pnode l, pnode r) {
    if (!l) {
      t = r;
      return;
    }
    if (!r) {
      t = l;
      return;
    }
    if (l->prior > r->prior)
      merge(l->r, l->r, r), t = l;
    else
      merge(r->l, l, r->l), t = r;
    update_size(t);
    operation(t);
  }
  void split(pnode t, pnode &l, pnode &r, int k) {
    if (!t) {
      l = nullptr;
      r = nullptr;
      return;
    }
    if (t->val <= k)
      split(t->r, t->r, r, k), l = t;
    else
      split(t->l, l, t->l, k), r = t;
    update_size(t);
    operation(t);
  }
  void split_by_size(pnode t, pnode &l, pnode &r, int k, int add = 0) {
    if (!t) {
      l = nullptr;
      r = nullptr;
      return;
    }
    int idx = add + size(t->l);
    if (idx <= k)
      split_by_size(t->r, t->r, r, k, idx + 1), l = t;
    else
      split_by_size(t->l, l, t->l, k, add), r = t;
    update_size(t);
    operation(t);
  }
  pnode root;
  implicit_treap() { root = nullptr; }
  void insert(int64_t val, int len) {
    if (!root) {
      pnode nw = new node(val, len);
      root = nw;
      return;
    }
    pnode l, r, nw = new node(val, len);
    split(root, l, r, val - 1);
    merge(l, l, nw);
    merge(root, l, r);
  }
  void erase(int64_t val) {
    if (!root) {
      return;
    }
    pnode l, r, mid;
    split(root, l, r, val - 1);
    split_by_size(r, mid, r, 0);
    merge(root, l, r);
  }
  int64_t get_hash() {
    if (!root) return base + 2;
    return ((pw[root->len] + root->hsh) * base + 2ll) % mod;
  }
  int64_t len() {
    if (!root) return 2;
    return (root->len) + 2;
  }
};
int n;
vector<int> G[MAXN];
void read() {
  cin >> n;
  for (int i = 0; i < n - 1; i++) {
    int u, v;
    cin >> u >> v;
    G[u].push_back(v);
    G[v].push_back(u);
  }
}
pair<int, int> ans;
map<int64_t, int> cnt;
int64_t res = 0, dp[MAXN];
implicit_treap t[MAXN];
void pre_dfs(int u, int pr) {
  for (int v : G[u])
    if (v != pr) {
      pre_dfs(v, u);
      t[u].insert(dp[v], t[v].len());
    }
  dp[u] = (t[u].get_hash());
  cnt[dp[u]]++;
  if (cnt[dp[u]] == 1) res++;
}
void change_root(int cur, int nxt) {
  cnt[dp[cur]]--;
  if (cnt[dp[cur]] == 0) res--;
  t[cur].erase(dp[nxt]);
  dp[cur] = t[cur].get_hash();
  cnt[dp[cur]]++;
  if (cnt[dp[cur]] == 1) res++;
  cnt[dp[nxt]]--;
  if (cnt[dp[nxt]] == 0) res--;
  t[nxt].insert(dp[cur], t[cur].len());
  dp[nxt] = t[nxt].get_hash();
  cnt[dp[nxt]]++;
  if (cnt[dp[nxt]] == 1) res++;
}
void solve(int u, int pr) {
  ans = max(ans, {res, -u});
  for (int v : G[u])
    if (v != pr) {
      change_root(u, v);
      solve(v, u);
    }
  if (pr != -1) change_root(u, pr);
}
void solve() {
  pw[0] = 1;
  for (int i = 1; i < MAXN; i++) pw[i] = (pw[i - 1] * base) % mod;
  pre_dfs(1, 1);
  ans = {res, -1};
  solve(1, -1);
  cout << -ans.second << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  read();
  solve();
  return 0;
}
