import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();
        TreeMap<String, Integer> map = new TreeMap<String, Integer>();
        int max = 0;
        for(int i=0;i<n;i++){
            String s = sc.next();
           if(map.containsKey(s)){
               int t = map.get(s) + 1;
               map.put(s, t);
               max = Math.max(t, max);
           } else {
               map.put(s, 1);
               max = Math.max(max,1);
           }
        }

        for(Map.Entry<String, Integer> entry :map.entrySet()){
            if(entry.getValue().equals(max)){
                System.out.println(entry.getKey());

            }
        }
    }
}

/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