#include <bits/stdc++.h>
using namespace std;
template <typename T>
void read(T &x) {
  x = 0;
  int f(1);
  char c = getchar();
  for (; !isdigit(c); c = getchar())
    if (c == '-') f = -1;
  for (; isdigit(c); c = getchar()) x = x * 10 + c - '0';
  x *= f;
}
template <typename T, typename... Args>
inline void read(T &x, Args &...args) {
  read(x);
  read(args...);
}
const int maxn = 100005;
int n, vis[40 * maxn], ANS, rt;
int tot, sz[maxn], nw;
unsigned long long pri[maxn], dp[maxn];
vector<int> T[maxn];
map<unsigned long long, int> cnt;
inline void Add(unsigned long long x) {
  cnt[x] += 1;
  if (cnt[x] == 1) ++nw;
}
inline void Del(unsigned long long x) {
  cnt[x] -= 1;
  if (cnt[x] == 0) --nw;
}
void Dfs(int x, int fa) {
  sz[x] = 1;
  for (auto y : T[x]) {
    if (y == fa) continue;
    Dfs(y, x);
    sz[x] += sz[y];
    dp[x] += dp[y] * pri[sz[y]];
  }
  dp[x] += 1;
  Add(dp[x]);
}
void Dfs2(int x, int fa) {
  if (nw > ANS) ANS = nw, rt = x;
  for (auto y : T[x]) {
    if (y == fa) continue;
    Del(dp[x]);
    Del(dp[y]);
    dp[x] -= dp[y] * pri[sz[y]];
    sz[x] -= sz[y];
    Add(dp[x]);
    dp[y] += dp[x] * pri[sz[x]];
    sz[y] += sz[x];
    Add(dp[y]);
    Dfs2(y, x);
    Del(dp[y]);
    sz[y] -= sz[x];
    dp[y] -= dp[x] * pri[sz[x]];
    Del(dp[x]);
    sz[x] += sz[y];
    dp[x] += dp[y] * pri[sz[y]];
    Add(dp[x]);
    Add(dp[y]);
  }
}
int main() {
  read(n);
  for (int i(1); i < n; ++i) {
    int u, v;
    read(u, v);
    T[u].emplace_back(v), T[v].emplace_back(u);
  }
  for (int i(2); i <= 40 * n; ++i) {
    if (!vis[i]) pri[++tot] = i;
    if (tot == n) break;
    for (int j(1); j <= tot; ++j) {
      if (i * pri[j] > 40 * n) break;
      vis[i * pri[j]] = 1;
      if (i % pri[j] == 0) break;
    }
  }
  Dfs(1, 0);
  Dfs2(1, 0);
  cout << rt << endl;
  return 0;
}
