1 #include <cmath>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <cstdlib>
 5 #include <iostream>
 6 #include <algorithm>
 7  
 8 using namespace std;
 9  
10 const int N = 5000005;
11  
12 int n, id = 1;
13  
14 long long sum, ans, son[N];
15  
16 int hd[N], nt[N], to[N], tot;
17  
18 void add(int x, int y)
19 {
20     nt[tot] = hd[x]; to[tot] = y; hd[x] = tot++;
21     nt[tot] = hd[y]; to[tot] = x; hd[y] = tot++;
22 }
23  
24 void prework(int u, int f, int d)
25 {
26     sum += d; son[u] = 1;
27      
28     for (int i = hd[u]; ~i; i = nt[i])
29         if (to[i] != f)prework(to[i], u, d + 1), son[u] += son[to[i]];
30 }
31  
32 void search(int u, int f, long long s)
33 {
34     if (ans < s || (ans == s && id > u))
35         ans = s, id = u;
36      
37     for (int i = hd[u]; ~i; i = nt[i])
38         if (to[i] != f)search(to[i], u, s + n - son[to[i]]*2);
39 }
40  
41 signed main(void)
42 {
43     scanf("%d", &n); 
44      
45     memset(hd, -1, sizeof(hd)); tot =0; 
46      
47     for (int i = 1, x, y; i < n; ++i)
48         scanf("%d%d", &x, &y), add(x, y);
49          
50     prework(1, -1, 0); search(1, -1, sum);
51      
52     printf("%d\n", id);
53 }