import java.util.Arrays;
import java.util.HashMap;
import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        // ABC155C - Poll

        Scanner sc = new Scanner(System.in);

        int n = sc.nextInt();

        String[] s = new String[n];
        int max = 1;
        HashMap<String, Integer> map = new HashMap();
        for (int i = 0; i < n; i++) {
            s[i] = sc.next();
            if (map.containsKey(s[i])) {
                int v = map.get(s[i]) + 1;
                map.put(s[i], v);
                if (v > max) max = v;
            } else {
                map.put(s[i], 1);
            }
        }

        Arrays.sort(s);

        for (int i = 0; i < n; i++) {
            int v = map.get(s[i]);
            if (v == max) {
                System.out.println(s[i]);
            }
            i += (v - 1);
        }

    }
}
/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