import java.util.*;

public class Main {

    public static void main(String[] args) {
	// write your code here
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        sc.nextLine();
        String curr;
        TreeMap<String,Integer> hm=new TreeMap<>();
        int currMax = 0;
        for (int i = 0; i < n; i++){
            curr = sc.nextLine();
            if(!hm.containsKey(curr)){
                hm.put(curr,1);
            } else{
                hm.put(curr, hm.get(curr)+1);
            }
            if(hm.get(curr)>=currMax)
                currMax = hm.get(curr);
        }
        for(Map.Entry e:hm.	entrySet()){
            if((int)e.getValue()==currMax)
                System.out.println(e.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