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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Random;
import java.io.IOException;
import java.util.HashMap;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
import java.util.Map;
import java.math.BigInteger;
import java.io.BufferedReader;
import java.util.Collections;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
	public static void main(String[] args) {
		InputStream inputStream = System.in;
		OutputStream outputStream = System.out;
		FastScanner in = new FastScanner(inputStream);
		PrintWriter out = new PrintWriter(outputStream);
		TaskD solver = new TaskD();
		solver.solve(1, in, out);
		out.close();
	}

	static class TaskD {
		int MOD;
		long X;
		int ans;
		int best;
		int n;
		List<Integer>[] adj;
		boolean[] was;
		int[] hash;
		Counter counter;
		Map<Long, Integer> edgeIds = new HashMap<>();

		public void solve(int testNumber, FastScanner in, PrintWriter out) {
			// todo: O(n^2 logn) on a star graph.
			n = in.nextInt();
			prepareMod();
			adj = new List[n];
			for (int i = 0; i < n; i++) {
				adj[i] = new ArrayList<>();
			}
			was = new boolean[3 * n];
			hash = new int[3 * n];
			for (int i = 0; i < n; i++) {
				addId(-1, i);
			}
			for (int i = 0; i < n - 1; i++) {
				int a = in.nextInt() - 1;
				int b = in.nextInt() - 1;
				adj[a].add(b);
				adj[b].add(a);
				addId(a, b);
				addId(b, a);
			}
			for (int i = 0; i < n; i++) {
				calc(-1, i);
			}
			ans = -1;
			best = -1;
			counter = new Counter();
			dfs1(-1, 0);
			dfs2(-1, 0);
			out.println(ans + 1);
		}

		private void calc(int parent, int root) {
			int e = edgeId(parent, root);
			if (was[e]) {
				return;
			}
			was[e] = true;

			List<Integer> h = new ArrayList<>();
			for (int child : adj[root]) {
				if (child == parent) {
					continue;
				}
				calc(root, child);
				int c = edgeId(root, child);
				h.add(hash[c]);
			}
			Collections.sort(h);
			long curHash = 1;
			for (int i = 0; i < h.size(); i++) {
				curHash = (curHash * X + h.get(i)) % MOD;
			}
			hash[e] = (int) curHash;
		}

		private void dfs1(int parent, int root) {
			for (int child : adj[root]) {
				if (child == parent) {
					continue;
				}
				counter.add(hash[edgeId(root, child)]);
				dfs1(root, child);
			}
		}

		private void dfs2(int parent, int root) {
			if (best < counter.numDifferent) {
				best = counter.numDifferent;
				ans = root;
			}
			for (int child : adj[root]) {
				if (child == parent) {
					continue;
				}
				int h1 = hash[edgeId(root, child)];
				int h2 = hash[edgeId(child, root)];
				counter.remove(h1);
				counter.add(h2);
				dfs2(root, child);
				counter.add(h1);
				counter.remove(h2);
			}
		}

		private int edgeId(int a, int b) {
			long key = (a + 1) * (long) (n + 1) + (b + 1);
			return edgeIds.get(key);
		}

		private void addId(int a, int b) {
			long key = (a + 1) * (long) (n + 1) + (b + 1);
			if (!edgeIds.containsKey(key)) {
				int v = edgeIds.size();
				edgeIds.put(key, v);
			}
		}

		private void prepareMod() {
			Random random = new Random(0);
			MOD = 1000000000 + random.nextInt(10000000);
			while (!BigInteger.valueOf(MOD).isProbablePrime(100)) {
				++MOD;
			}

			X = 0;
			while (X == 0) {
				X = random.nextInt(MOD);
			}
		}

		class Counter {
			Map<Integer, Integer> m = new HashMap<>();
			int numDifferent = 0;

			void add(int k) {
				int v = 0;
				if (m.containsKey(k)) {
					v = m.get(k);
				} else {
					++numDifferent;
				}
				m.put(k, v + 1);
			}

			void remove(int k) {
				int v = m.get(k);
				if (v == 1) {
					--numDifferent;
					m.remove(k);
				} else {
					m.put(k, v - 1);
				}
			}

		}

	}

	static class FastScanner {
		private BufferedReader in;
		private StringTokenizer st;

		public FastScanner(InputStream stream) {
			in = new BufferedReader(new InputStreamReader(stream));
		}

		public String next() {
			while (st == null || !st.hasMoreTokens()) {
				try {
					String rl = in.readLine();
					if (rl == null) {
						return null;
					}
					st = new StringTokenizer(rl);
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
			}
			return st.nextToken();
		}

		public int nextInt() {
			return Integer.parseInt(next());
		}

	}
}

