import java.util.*;

class Main{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		Map<String,Integer> map = new HashMap<String,Integer>();
		String tmp = sc.nextLine();
		for(int i = 0;i < n; ++i){
			String s = sc.nextLine();
			map.putIfAbsent(s,0);
			map.put(s,map.get(s) + 1);
		}
		SortedSet<String> st = new TreeSet<>();
		int maxi = 0;
		for(Map.Entry<String,Integer> entry : map.entrySet()){
			maxi = Math.max(maxi,entry.getValue());
			// System.out.printf(" %s %d \n",entry.getKey(),entry.getValue());
		}
		// System.out.println(maxi);	
		for(Map.Entry<String,Integer> entry : map.entrySet()){
			if(entry.getValue() == maxi){
				st.add(entry.getKey());
			}
		}

		for(String ele : st){
			System.out.println(ele);
		}
	}
}
/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