import java.util.*;
public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		Map<String, Integer> m = new TreeMap<>();
		int max = 1;
		for(int i = 0; i < N; i++) {
			String S = sc.next();
			if(m.containsKey(S)) {
				m.put(S, m.get(S)+1);
				max = Math.max(max, m.get(S));
			}
			else
				m.put(S, 1);
		}
		List<String> l = new ArrayList<>();
		for(String s : m.keySet()) {
			if(m.get(s) == max)
				l.add(s);
		}
		Collections.sort(l);
		for(String s : l)
			System.out.println(s);

	}

}
/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