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();

        Map<String, Integer> wordmap = new TreeMap<>();
        int max = 0;
        for (int i=0;i<N;i++) {
            String S_n = sc.next();
            if (wordmap.containsKey(S_n)) {
                int count = wordmap.get(S_n);
                wordmap.put(S_n, count + 1);
                if (max <= count) max = count + 1;
            } else {
                wordmap.put(S_n, 1);
                if (max == 0) max = 1;
            }
        }

        for (String key : wordmap.keySet()) {
            if (wordmap.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