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

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int max = 0;
		Map<String, Integer> voteMap = new TreeMap<String, Integer>();

		for (int i = 0; i < N; i++) {
			String item = sc.next();

			if (voteMap.containsKey(item)) {
				voteMap.put(item, voteMap.get(item) + 1);
				if (max < voteMap.get(item)) {
					max = voteMap.get(item);
				}
			}else {
				voteMap.put(item, 0);
			}
		}

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