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

class Main {
    public static void main(String[] args) {
        Scanner stdIn = new Scanner(System.in);
        TreeMap<String, Integer> tm = new TreeMap<String, Integer>();
        int n = Integer.parseInt(stdIn.next());
        String s;
        for (int i = 0; i < n; i++) {
            s = stdIn.next();
            int count = 1;
            if (tm.containsKey(s)) {
                count += tm.get(s);
            }
            tm.put(s, count);
        }

        int maxValue = 0;
        for (int value : tm.values()) {
            if (value > maxValue) {
                maxValue = value;
            }
        }

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