import java.util.*;
//import java.math.BigInteger;
 
public class Main {
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int N = sc.nextInt();
        //ArrayList <String> arrlist = new ArrayList <String>();
        TreeMap <String,Integer> treemap = new TreeMap <String,Integer>();
        int max = 0;
        
        for(int i=0; i<N; i++){
            String S = sc.next();
            if(treemap.containsKey(S)){
                treemap.put(S, treemap.get(S)+1);
            }else{
                treemap.put(S, 1);
            }
            //System.out.println(treemap);
        }
        //for(Map.Entry<String, String> entry : treemap.entrySet()){
        for(String S: treemap.keySet()){
            if(max < treemap.get(S)){
                max = treemap.get(S);
            }
        }
        for(String S: treemap.keySet()){
            if(max == treemap.get(S)){
                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