import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc=new Scanner(System.in);
		
		int n=sc.nextInt();		//n枚の投票用紙
		
		 Map<String, Integer>map=new HashMap<>();
		 
	        int max=0;
	        for(int i=0;i<n;i++) {
	            String s=sc.next();
	            if (map.containsKey(s)) {
	                map.put(s,map.get(s) + 1);
	 
	            }else{
	                map.put(s,1);
	            }
	            max=Math.max(max,map.get(s));
	        }
	 
	        List<String>array= new ArrayList<>();
	        for (Map.Entry<String, Integer>key: map.entrySet()) {
	            if (key.getValue() == max) {
	                array.add(key.getKey());
	            }
	        }
	        Collections.sort(array);
	        for (String s:array) {
	            System.out.println(s);
	    }
	        sc.close();
	}

}
/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