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

public class Main {

	public static int N;
	public static Map<String, Integer> wordCount = new TreeMap<String, Integer>();

	public static void main(String[] args) {
		init();
		int max = 0;
		for (int v : wordCount.values()) {
			if (v > max) {
				max = v;
			}
		}
		for (String w : wordCount.keySet()) {
			if (wordCount.get(w) == max) {
				System.out.println(w);
			}
		}
	}

	public static void init() {
		Scanner sc = new Scanner(System.in);
		try {
			N = sc.nextInt();
			for (int i = 0; i < N; i++) {
				String w = sc.next();
				if (wordCount.containsKey(w)) {
					int count = wordCount.get(w);
					wordCount.put(w, ++count);
				} else {
					wordCount.put(w, 1);
				}
			}
		} catch (Exception e) {
			e.printStackTrace();
		}
	}

}

/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