import java.util.*;


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

        for (int i = 0; i < N; i++) {
            String tmp = sc.nextLine();
            if (dic.get(tmp) == null){
                dic.put(tmp, 1);
            } else {
                int x = dic.get(tmp)+1;
                dic.put(tmp, x);
            }
        }

        for (int i : dic.values()){
            if (max < i){
                max = i;
            }
        }

        for (String s : dic.keySet()){
            if(dic.get(s) == max) {
                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