import java.io.InputStream;
import java.io.PrintStream;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Comparator;
import java.util.HashMap;
import java.util.List;
import java.util.Map.Entry;
import java.util.Scanner;

public class Main {
	InputStream in = System.in;
	PrintStream out = System.out;

	public void _main(String[] args) {
		Scanner sc = new Scanner(in);

		int N = sc.nextInt();
		String[] S = new String[N];
		for (int i = 0; i < N; i++) {
			S[i] = sc.next();
		}

		sc.close();

		HashMap<String, Integer> m = new HashMap<>();

		int max = 0;

		for (int i = 0; i < N; i++) {
			if (!m.containsKey(S[i])) {
				m.put(S[i], 1);
				max = Math.max(max, 1);
			} else {
				int x = m.get(S[i]);
				x++;
				max = Math.max(max, x);
				m.put(S[i], x);
			}
		}

		List<String> result = new ArrayList<>();

		for (Entry<String, Integer> e : m.entrySet()) {
			if (e.getValue() == max) {
				result.add(e.getKey());
			}
		}

		result.sort(Comparator.naturalOrder());

		for (String s : result) {
			out.println(s);
		}
	}

	public static void main(String[] args) {
		new Main()._main(args);
	}
}

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz