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

import java.io.*;
import java.util.*;

public class D_test {

	BufferedReader br;
	PrintWriter out;
	StringTokenizer st;
	boolean eof;

	List<Integer>[] g;

	Random rng = new Random(System.currentTimeMillis() + 12983195189052L);

	long[] multHash;
	long addHash;

	HashMap<Long, Integer> myMap = new HashMap<>();
	
	void genHash() {
		multHash = new long[n];
		for (int i = 0; i < n; i++) {
			multHash[i] = rng.nextLong();
		}
		addHash = rng.nextLong();
	}

	long[][] arr;
	int[] ptr;

	long[] hashDown;
	long[] hashUp;

	int time;

	void dfs1(int v, int p) {
		ptr[v] = 0;
		for (int u : g[v]) {
			if (u != p) {
				depth[u] = depth[v] + 1;
				dfs1(u, v);
				arr[v][ptr[v]++] = hashDown[u];
			}
		}
		Arrays.sort(arr[v], 0, ptr[v]);
		hashDown[v] = addHash;
		for (int i = 0; i < ptr[v]; i++) {
			hashDown[v] += multHash[i] * arr[v][i];
		}
		
		Integer prev = myMap.get(hashDown[v]);
		if (prev == null) {
			prev = myMap.size() + 1;
			myMap.put(hashDown[v], prev);
		}
		
		hashDown[v] = prev;
	}

	int findWhere(long[] arr, int sz, long what) {
		int low = -1; // <
		int high = sz; // >=
		while (high - low > 1) {
			int mid = (low + high) >> 1;
			if (arr[mid] < what) {
				low = mid;
			} else {
				high = mid;
			}
		}
		return high;
	}

	void dfs2(int v, int p, long hashUp) {
		if (p != v) {
			
			Integer prev = myMap.get(hashUp);
			if (prev == null) {
				prev = myMap.size() + 1;
				myMap.put(hashUp, prev);
			}
			
			hashUp = prev;
			
			int where = findWhere(arr[v], ptr[v], hashUp);
			for (int i = ptr[v] - 1; i >= where; i--) {
				arr[v][i + 1] = arr[v][i];
			}
			arr[v][where] = hashUp;
			ptr[v]++;
			this.hashUp[v] = hashUp;
		}

		long[] newHash = new long[ptr[v]];
		long base = addHash;
		for (int i = 1; i < ptr[v]; i++) {
			base += multHash[i - 1] * arr[v][i];
		}
		newHash[0] = base;

		for (int i = 1; i < ptr[v]; i++) {
			base += multHash[i - 1] * (arr[v][i - 1] - arr[v][i]);
			newHash[i] = base;
		}

		for (int u : g[v]) {
			if (u == p) {
				continue;
			}

			int idx = findWhere(arr[v], ptr[v], hashDown[u]);
			dfs2(u, v, newHash[idx]);
		}
	}

	int[] delta;
	int[] depth;

	void dfs3(int v, int p) {
		for (int u : g[v]) {
			if (u != p) {
				delta[u] += delta[v];
				dfs3(u, v);
			}
		}
	}

	int n;
	
	int solve(){
		if (n == 1) {
			return 0;
		}

		genHash();

		arr = new long[n][];
		ptr = new int[n];
		for (int i = 0; i < n; i++) {
			arr[i] = new long[g[i].size()];
		}

		depth = new int[n];
		hashDown = new long[n];
		dfs1(0, 0);

		hashUp = new long[n];
		dfs2(0, 0, 0);

//		 System.err.println(Arrays.toString(hashDown));
//		 System.err.println(Arrays.toString(hashUp));

		HashMap<Long, ArrayList<Integer>> map = new HashMap<>();

		for (int i = 1; i < n; i++) {

			{
				long what = hashDown[i];
				int val = i;

				ArrayList<Integer> prev = map.get(what);
				if (prev == null) {
					prev = new ArrayList<>();
					map.put(what, prev);
				}
				prev.add(val);
			}

			{
				long what = hashUp[i];
				int val = ~i;

				ArrayList<Integer> prev = map.get(what);
				if (prev == null) {
					prev = new ArrayList<>();
					map.put(what, prev);
				}
				prev.add(val);
			}

		}

		delta = new int[n];

		outer: for (Map.Entry<Long, ArrayList<Integer>> e : map.entrySet()) {
			ArrayList<Integer> lst = e.getValue();

//			 System.err.println(lst);

			int cntDown = 0;

			int whoDown = -1;

			for (int v : lst) {
				if (v >= 0) {
					cntDown++;
					whoDown = v;
				}
			}
			if (cntDown >= 2) {
				continue;
			}

			if (cntDown == 0) {
				for (int v : lst) {
					if (v >= 0) {
						delta[v]--;
					} else {
						delta[~v]++;
					}
				}
				continue;
			}

			for (int v : lst) {
				if (v < 0) {
					v = ~v;
					if (depth[v] <= depth[whoDown]) {
						continue outer;
					}
				}
			}

			for (int v : lst) {
				if (v >= 0) {
					delta[v]--;
				} else {
					delta[~v]++;
				}
			}

			// System.err.println(Arrays.toString(delta));
		}
		
		dfs3(0, 0);

//		System.err.println(Arrays.toString(delta));
		
		int best = Integer.MIN_VALUE;
		int ans = -1;

		for (int i = 0; i < n; i++) {
			if (delta[i] > best) {
				best = delta[i];
				ans = i;
			}
		}
		
		return ans;
	}
	
	ArrayList<int[]> dict = new ArrayList<>();

	int getId(int[] arr) {
		for (int i = 0; i < dict.size(); i++) {
			if (Arrays.equals(arr, dict.get(i))) {
				return i;
			}
		}
		dict.add(arr);
		return dict.size() - 1;
	}
	
	int dfsSlow(int v, int p, HashSet<Integer> diff) {
		int[] arr = new int[g[v].size() - (v == p ? 0 : 1)];
		int ptr = 0;
		for (int u : g[v]) {
			if (u != p) {
				arr[ptr++] = dfsSlow(u, v, diff);
			}
		}
		Arrays.sort(arr);
		int ret = getId(arr);
		diff.add(ret);
		return ret;
	}
	
	int solveSlow() {
		int ans = -1;
		int best = -1;
		
		for (int i = 0; i < n; i++) {
			HashSet<Integer> diff = new HashSet<>();
			dfsSlow(i, i, diff);
			System.err.println(diff.size());
			if (diff.size() > best) {
				best = diff.size();
				ans = i;
			}
		}
		
		return ans;
	}
	
	void submit() throws IOException {
		n = nextInt();
		g = new List[n];
		for (int i = 0; i < n; i++) {
			g[i] = new ArrayList<>();
		}
		
		for (int i = 0; i < n - 1; i++) {
			int v = nextInt() - 1;
			int u = nextInt() - 1;
			g[v].add(u);
			g[u].add(v);
		}
		out.println(solve() + 1);
//		out.println(solveSlow() + 1);
	}
	
	void test() {
		g = new List[n];
		for (int i = 0; i < n; i++) {
			g[i] = new ArrayList<>();
		}
		
		for (int i = 1; i < n; i++) {
			int j = rng.nextInt(i);
			g[i].add(j);
			g[j].add(i);
		}
		
//		System.err.println(Arrays.toString(g));
		
		if (solve() != solveSlow()) {
			System.err.println(n);
			for (int v = 0; v < n; v++) {
				for (int u : g[v]) {
					if (v < u) {
						System.err.println((v + 1) + " " + (u + 1));
					}
				}
			}
			throw new AssertionError();
		}
	}
	
	D_test() throws IOException {
		br = new BufferedReader(new InputStreamReader(System.in));
		out = new PrintWriter(System.out);
		submit();
		
//		n = 50;
//		for (int tst = 0; tst < Integer.MAX_VALUE; tst++) {
//			test();
//			System.err.println(tst);
//		}
		
		out.close();
	}

	public static void main(String[] args) throws IOException {
		new D_test();
	}

	String nextToken() {
		while (st == null || !st.hasMoreTokens()) {
			try {
				st = new StringTokenizer(br.readLine());
			} catch (Exception e) {
				eof = true;
				return null;
			}
		}
		return st.nextToken();
	}

	String nextString() {
		try {
			return br.readLine();
		} catch (IOException e) {
			eof = true;
			return null;
		}
	}

	int nextInt() throws IOException {
		return Integer.parseInt(nextToken());
	}

	long nextLong() throws IOException {
		return Long.parseLong(nextToken());
	}

	double nextDouble() throws IOException {
		return Double.parseDouble(nextToken());
	}
}