import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;

public class Main {

    public static void main(String[] args) {
        
        Scanner sc = new Scanner(System.in);
        
        int n = Integer.parseInt(sc.next());
        Map<String, Integer> map = new TreeMap<>();
        int max = 0;
        for(int i = 0; i < n; i++){
            String s = sc.next();
            int a = map.getOrDefault(s, 0) +1;
            if(a > max) max = a;
            map.put(s, a);
        }
        
        StringBuilder sb = new StringBuilder();
        for (String s : map.keySet()) {
            if(map.get(s) == max){
                sb.append(s).append(System.lineSeparator());
            }
        }
        System.out.print(sb);
    }
}
/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