
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 = sc.nextInt();
        String A;
        TreeMap<String,Integer> B=new TreeMap<>();
        int max=0;
        int count;
        for (int i = 0; i < N; i++) {
            A = sc.next();
            if (B.containsKey(A)) {
                count=B.get(A)+1;
                B.put(A, count);
            }else{
                B.put(A, 1);
            }
            max=Math.max(B.get(A), max);
        }

        //System.out.println(B.toString());

        for (String str : B.keySet()) {
            if (B.get(str)==max) {
                System.out.println(str);
            }
        }
    }
}
/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