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

public class Main {
    public static void main(String[] args) {
        try (Scanner sc = new Scanner(System.in)) {
            int N = sc.nextInt();
            String[] S = new String[N];
            for (int i = 0; i < N; i++) {
                S[i] = sc.next();
            }

            HashMap<String, Integer> sToNumber = new HashMap<String, Integer>();
            for (int i = 0; i < N; i++) {
                Integer number = sToNumber.get(S[i]);
                sToNumber.put(S[i], 1 + (number == null ? 0 : number.intValue()));
            }

            ArrayList<String> list = new ArrayList<>();
            int max = 0;
            for (String key : sToNumber.keySet()) {
                int number = sToNumber.get(key).intValue();
                if (number >= max) {
                    if (number > max) {
                        max = number;
                        list.clear();
                    }
                    list.add(key);
                }
            }
            Collections.sort(list);

            for (int i = 0; i < list.size(); i++) {
                System.out.println(list.get(i));
            }
        }
    }
}
/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