10
6 8
3 10
1 9
6 1
8 2
5 7
3 6
10 4
3 5
 1
 5
1 2
2 3
3 4
4 5
 7
2 3
2 6
1 2
3 7
6 5
3 4
 10
8 4
8 10
8 1
8 2
5 9
5 3
5 7
8 5
5 6
 10
8 6
3 4
10 9
7 10
1 3
4 2
6 1
5 8
9 5
 10
1 10
6 9
5 4
1 3
1 2
3 8
6 7
8 6
1 5
 20
13 4
7 6
9 13
9 2
9 16
4 18
16 5
11 15
16 14
13 12
13 8
16 17
7 1
9 19
17 3
15 20
1 11
2 7
5 10
 3
1 2
1 3
 50
18 47
18 12
42 16
21 44
43 39
20 27
25 1
11 29
9 24
19 42
3 34
16 38
14 48
23 41
8 43
29 2
40 4
45 36
43 9
49 3
41 17
41 15
35 49
43 20
5 32
34 46
8 21
43 45
29 40
39 26
27 33
24 50
38 7
39 19
43 31
24 10
3 14
39 22
43 23
47 13
20 11
25 8
16 30
44 18
19 37
39 5
49 28
25 35
46 6
 15
11 2
5 13
9 4
5 7
11 5
13 14
2 10
3 11
7 1
7 6
10 15
9 12
2 9
10 8
 31
15 2
23 19
11 4
26 6
1 20
14 11
19 13
26 12
12 27
20 14
22 21
4 16
10 18
5 23
4 31
12 8
2 17
19 30
14 26
2 28
22 7
23 9
20 5
5 15
9 29
15 10
6 25
6 24
9 3
11 22
 63
34 40
43 62
33 43
49 6
17 47
26 13
35 15
40 16
17 44
37 34
18 55
57 10
16 14
39 56
36 5
4 33
4 59
54 24
37 45
21 31
57 2
19 8
43 41
49 48
15 19
35 4
15 63
30 50
11 30
59 18
20 46
18 1
33 17
31 22
40 54
63 49
29 25
46 9
16 3
42 23
59 7
54 53
42 38
8 60
8 58
7 51
36 28
63 36
21 57
25 37
45 20
25 35
19 26
20 42
30 32
11 39
7 12
31 52
45 21
26 27
34 11
46 61

9
 1
 1
 1
 1
 2
 10
 18
 2
 13
 1
 3
 1

//package round395;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.Arrays;
import java.util.HashMap;
import java.util.InputMismatchException;
import java.util.Map;
import java.util.Random;

public class D2 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	int[] mods = new int[2];
	int[] muls = new int[2];
	long[] anss;
	long[][] pows = new long[2][];
	
	void solve()
	{
		int n = ni();
		int[] from = new int[n - 1];
		int[] to = new int[n - 1];
		for (int i = 0; i < n - 1; i++) {
			from[i] = ni() - 1;
			to[i] = ni() - 1;
		}
		int[][] g = packU(n, from, to);
		int[][] pars = parents3(g, 0);
		int[] par = pars[0], ord = pars[1], dep = pars[2];
		
		Random gen = new Random();
		for(int i = 0;i < 2;i++){
			mods[i] = BigInteger.probablePrime(30, gen).intValue();
			muls[i] = BigInteger.probablePrime(29, gen).intValue();
			pows[i] = enumPows(muls[i], 105000, mods[i]);
		}
		
		long[][] hs = new long[2][n];
		for(int z = 0;z < 2;z++){
			long[] temp = new long[n];
			for(int i = n-1;i >= 0;i--){
				int cur = ord[i];
				long h = 114514;
				int p = 0;
				for(int e : g[cur]){
					if(e == par[cur])continue;
					temp[p++] = hs[z][e];
				}
				Arrays.sort(temp, 0, p);
				for(int j = 0;j < p;j++){
					h = (h * muls[z] + temp[j] * temp[j]) % mods[z];
				}
				hs[z][cur] = h;
			}
		}
		Map<Long, Integer> lhc = new HashMap<>();
		for(int i = 0;i < n;i++){
			inc(lhc, hs[0][i]<<32|hs[1][i], 1);
//			tr(hs[0][i]<<32|hs[1][i], 1);
		}
		
		max = -1;
		argmax = -1;
		
//		anss = new long[n];
		dfs(0, -1, new long[]{hs[0][0], hs[1][0]}, par, g, hs, lhc);
		out.println(argmax+1);
//		for(int i = 0;i <n;i++){
//			out.println(anss[i]);
//		}
	}
	
	void inc(Map<Long, Integer> map, long k, int v)
	{
		if(map.containsKey(k)){
			if(map.get(k) + v == 0){
				map.remove(k);
			}else{
				map.put(k, map.get(k) + v);
			}
		}else{
			map.put(k, v);
		}
	}
	
	public static long invl(long a, long mod) {
		long b = mod;
		long p = 1, q = 0;
		while (b > 0) {
			long c = a / b;
			long d;
			d = a;
			a = b;
			b = d % b;
			d = p;
			p = q;
			q = d - c * q;
		}
		return p < 0 ? p + mod : p;
	}

	
	public static long[] enumPows(int a, int n, int mod)
	{
		a %= mod;
		long[] pows = new long[n+1];
		pows[0] = 1;
		for(int i = 1;i <= n;i++)pows[i] = pows[i-1] * a % mod;
		return pows;
	}
	
	int max = -1;
	int argmax = -1;
	
	void dfs(int cur, int pre, long[] downh, int[] par, int[][] g, long[][] hs, Map<Long, Integer> lhc)
	{
		inc(lhc, hs[0][cur]<<32|hs[1][cur], -1);
//		tr(hs[0][cur]<<32|hs[1][cur], -1);
//		tr(lhc.size);
		
		long[][] temp = new long[2][g[cur].length];
		
		long[][] ph = new long[2][g[cur].length+1];
		for(int z = 0;z < 2;z++){
			int p = 0;
			for(int e : g[cur]){
				if(e == par[cur]){
					temp[z][p++] = downh[z];
				}else{
					temp[z][p++] = hs[z][e];
				}
			}
			Arrays.sort(temp[z]);
			
			ph[z][0] = 114514;
			for(int j = 0;j < p;j++){
				ph[z][j+1] = (ph[z][j] * muls[z] + temp[z][j] * temp[z][j]) % mods[z];
			}
		}
//		tr(cur);
//		anss[cur] = lhc.size() + 1;
		if(lhc.size() > max){
			max = lhc.size();
			argmax = cur;
		}
		
		long[] lhs = new long[2];
		for(int e : g[cur]){
			if(e == pre)continue;
			for(int z = 0;z < 2;z++){
				int ind = Arrays.binarySearch(temp[z], hs[z][e]);
				assert ind >= 0;
				long lower = (ph[z][ph[0].length-1] - ph[z][ind+1] * pows[z][ph[0].length-1-(ind+1)]);
				long higher = ph[z][ind] * pows[z][ph[0].length-2-ind];
				long lh = (higher+lower) % mods[z];
				if(lh < 0)lh += mods[z];
				lhs[z] = lh;
			}
			inc(lhc, lhs[0]<<32|lhs[1], 1);
//			tr(lhs[0]<<32|lhs[1], 1);
			dfs(e, cur, lhs, par, g, hs, lhc);
			inc(lhc, lhs[0]<<32|lhs[1], -1);
//			tr(lhs[0]<<32|lhs[1], -1);
		}
		inc(lhc, hs[0][cur]<<32|hs[1][cur], 1);
//		tr(hs[0][cur]<<32|hs[1][cur], 1);
	}

	public static int[][] parents3(int[][] g, int root) {
		int n = g.length;
		int[] par = new int[n];
		Arrays.fill(par, -1);

		int[] depth = new int[n];
		depth[0] = 0;

		int[] q = new int[n];
		q[0] = root;
		for (int p = 0, r = 1; p < r; p++) {
			int cur = q[p];
			for (int nex : g[cur]) {
				if (par[cur] != nex) {
					q[r++] = nex;
					par[nex] = cur;
					depth[nex] = depth[cur] + 1;
				}
			}
		}
		return new int[][] { par, q, depth };
	}

	static int[][] packU(int n, int[] from, int[] to) {
		int[][] g = new int[n][];
		int[] p = new int[n];
		for (int f : from)
			p[f]++;
		for (int t : to)
			p[t]++;
		for (int i = 0; i < n; i++)
			g[i] = new int[p[i]];
		for (int i = 0; i < from.length; i++) {
			g[from[i]][--p[from[i]]] = to[i];
			g[to[i]][--p[to[i]]] = from[i];
		}
		return g;
	}

	
	void run() throws Exception
	{
		is = oj ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		tr(System.currentTimeMillis()-s+"ms");
	}
	
	public static void main(String[] args) throws Exception { new D2().run(); }
	
	private byte[] inbuf = new byte[1024];
	public int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private boolean oj = System.getProperty("ONLINE_JUDGE") != null;
	private void tr(Object... o) { if(!oj)System.out.println(Arrays.deepToString(o)); }
}
