#include <bits/stdc++.h>
using namespace std;
const long long P = 97;
const int N = 1e5;
int n;
vector<int> adj[N + 5];
long long pang[2 * N + 5];
void pre() {
  pang[0] = 1ll;
  for (int i = 1; i <= 2 * N + 2; i++) {
    pang[i] = pang[i - 1] * P;
  }
}
pair<long long, int> hash_v[N + 5];
inline pair<long long, int> add(pair<long long, int> a,
                                pair<long long, int> b) {
  return make_pair(a.first * pang[b.second] + b.first, a.second + b.second);
}
inline pair<long long, int> subs(pair<long long, int> a,
                                 pair<long long, int> b) {
  int dif = a.second - b.second;
  pair<long long, int> ret = a;
  ret.first -= pang[dif] * b.first;
  ret.second -= b.second;
  return ret;
}
inline pair<long long, int> make_inside(pair<long long, int> a) {
  pair<long long, int> ret = a;
  ret.first += pang[ret.second];
  ret.first *= P;
  ret.first += 2ll;
  ret.second += 2;
  return ret;
}
map<pair<long long, int>, int> ada;
bool cmp(int a, int b) { return hash_v[a] < hash_v[b]; }
void init(int now, int bef = -1) {
  pair<long long, int> cur_hash = make_pair(0, 0);
  for (int i = 0; i < adj[now].size(); i++) {
    int nxt = adj[now][i];
    if (nxt == bef) continue;
    init(nxt, now);
  }
  sort(adj[now].begin(), adj[now].end(), cmp);
  for (int i = 0; i < adj[now].size(); i++) {
    int nxt = adj[now][i];
    if (nxt == bef) continue;
    cur_hash = add(cur_hash, hash_v[nxt]);
  }
  cur_hash = make_inside(cur_hash);
  hash_v[now] = cur_hash;
  return;
}
vector<pair<long long, int> > child[N + 5];
void dfs(int now, int bef, int &idx, int &beda) {
  sort(adj[now].begin(), adj[now].end(), cmp);
  child[now].push_back(make_pair(0, 0));
  for (int i = 0; i < adj[now].size(); i++) {
    int nxt = adj[now][i];
    child[now].push_back(add(child[now].back(), hash_v[nxt]));
  }
  for (int i = 0; i < adj[now].size(); i++) {
    int nxt = adj[now][i];
    if (nxt == bef) continue;
    ada[hash_v[nxt]]--;
    if (ada[hash_v[nxt]] == 0) ada.erase(hash_v[nxt]);
    pair<long long, int> kiri = child[now][i];
    pair<long long, int> kanan = subs(child[now].back(), child[now][i + 1]);
    hash_v[now] = make_inside(add(kiri, kanan));
    ada[hash_v[now]]++;
    if ((int)ada.size() > beda) {
      beda = ada.size();
      idx = nxt;
    }
    dfs(nxt, now, idx, beda);
    ada[hash_v[now]]--;
    if (ada[hash_v[now]] == 0) ada.erase(hash_v[now]);
    pair<long long, int> sisa = subs(child[now][i + 1], child[now][i]);
    hash_v[nxt] = sisa;
    ada[hash_v[nxt]]++;
  }
  return;
}
int main() {
  pre();
  scanf("%d", &n);
  for (int i = 1; i < n; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  init(1);
  for (int i = 2; i <= n; i++) {
    ada[hash_v[i]]++;
  }
  int cans = 1;
  int cdit = ada.size();
  dfs(1, -1, cans, cdit);
  printf("%d\n", cans);
  return 0;
}
