#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const int base = 100003;
using namespace std;
struct edge {
  int to, next;
} G[maxn << 1];
int head[maxn], tot, tol, num[maxn << 1], id[maxn], ansv, ansnum, cnt;
map<unsigned long long, int> mp;
vector<int> vec[maxn];
vector<unsigned long long> sum[maxn];
unsigned long long p[maxn], h[maxn];
void init() {
  memset(head, -1, sizeof(head));
  tot = tol = 0;
}
void addedge(int u, int v) {
  G[tot] = edge{v, head[u]};
  head[u] = tot++;
}
int getid(unsigned long long x) {
  if (mp.find(x) != mp.end()) return mp[x];
  mp[x] = ++tol;
  return tol;
}
void setid(int u) {
  h[u] = 0;
  if (!vec[u].empty()) {
    sort(vec[u].begin(), vec[u].end());
    sum[u].clear();
    sum[u].push_back(vec[u][0]);
    h[u] = vec[u][0];
    for (int i = 1; i < vec[u].size(); ++i) {
      h[u] = h[u] * base + vec[u][i];
      sum[u].push_back(h[u]);
    }
  }
  id[u] = getid(h[u]);
}
void add(int x) {
  ++num[x];
  if (num[x] == 1) ++cnt;
}
void sub(int x) {
  --num[x];
  if (num[x] == 0) --cnt;
}
void dfs1(int u, int fa) {
  for (int i = head[u]; ~i; i = G[i].next) {
    int v = G[i].to;
    if (v == fa) continue;
    dfs1(v, u);
    vec[u].push_back(id[v]);
  }
  setid(u);
  ++num[id[u]];
}
void dfs2(int u, int fa) {
  if (cnt > ansnum) {
    ansv = u;
    ansnum = cnt;
  }
  int sz = vec[u].size();
  for (int i = head[u]; ~i; i = G[i].next) {
    int v = G[i].to;
    if (v == fa) continue;
    int pos = lower_bound(vec[u].begin(), vec[u].end(), id[v]) - vec[u].begin();
    unsigned long long t = 0;
    if (pos > 0) t += sum[u][pos - 1] * p[sz - pos - 1];
    if (pos < sz - 1) t += sum[u].back() - sum[u][pos] * p[sz - pos - 1];
    int tmp1 = getid(t), tmp2 = id[v];
    vec[v].push_back(tmp1);
    setid(v);
    add(tmp1), add(id[v]), sub(id[u]), sub(tmp2);
    dfs2(v, u);
    add(id[u]), add(tmp2), sub(tmp1), sub(id[v]);
  }
}
int main() {
  p[0] = 1;
  for (int i = 1; i < maxn; ++i) p[i] = p[i - 1] * base;
  int n;
  init();
  scanf("%d", &n);
  for (int i = 1; i < n; ++i) {
    int u, v;
    scanf("%d%d", &u, &v);
    addedge(u, v);
    addedge(v, u);
  }
  dfs1(1, 0);
  ansnum = -1;
  cnt = 0;
  for (int i = 1; i <= tol; ++i)
    if (num[i] > 0) ++cnt;
  dfs2(1, 0);
  printf("%d\n", ansv);
  return 0;
}
