#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, const U &b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, const U &b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T1, class T2>
inline void gn(T1 &x1, T2 &x2) {
  gn(x1), gn(x2);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
map<unsigned long long, int> mp;
int cur;
int get(unsigned long long first) {
  if (mp.count(first)) return mp[first];
  return mp[first] = ++cur;
}
unsigned long long val[100100 << 1];
int id[100100];
int cnt[100100 << 1], tot;
void add(int first) { tot += !cnt[first]++; }
void del(int first) { tot -= !--cnt[first]; }
unsigned long long sum[100100];
vector<int> adj[100100];
void dfs(int u, int f = 0) {
  for (int v : adj[u]) {
    if (v == f) continue;
    dfs(v, u);
    sum[u] += val[id[v]];
  }
  id[u] = get(sum[u]);
  add(id[u]);
}
pair<int, int> ans;
void redfs(int u, int f = 0, int pre = 0) {
  del(id[u]);
  add(get(sum[u] + val[pre]));
  smax(ans, pair<int, int>(tot, -u));
  del(get(sum[u] + val[pre]));
  for (int v : adj[u]) {
    if (v == f) continue;
    unsigned long long pp = sum[u] + val[pre] - val[id[v]];
    add(get(pp));
    redfs(v, u, get(pp));
    del(get(pp));
  }
  add(id[u]);
}
int main() {
  int n;
  cin >> n;
  for (int i = 1; i < n; i++) {
    int u, v;
    gn(u, v);
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  for (int i = 1; i < n << 1; i++)
    val[i] = ((unsigned long long)rand() << 40) +
             ((unsigned long long)rand() << 20) + (unsigned long long)rand();
  dfs(1);
  redfs(1);
  cout << -ans.second << endl;
  return 0;
}
