import java.util.Scanner;
import java.util.TreeMap;

class Main {
	public static void main(String[] args) {
		Scanner scanner = new Scanner(System.in);
		int N = scanner.nextInt();
		TreeMap<String, Integer> treeMap = new TreeMap<String, Integer>();
		for (int i = 0; i < N; i++) {
			String s = scanner.next();
			if (!treeMap.containsKey(s))
				treeMap.put(s, 1);
			else
				treeMap.put(s, treeMap.get(s) + 1);
		}

		int max = 0;
		for (String key : treeMap.keySet()) {
			if (max < treeMap.get(key))
				max = treeMap.get(key);
		}

		for (String key : treeMap.keySet())
			if (treeMap.get(key) == max)
				System.out.println(key);
	}
}
/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