import java.util.*;

class Main {
    public static void main(String[] args) {
        new Solver().run();
    }
}

class Solver {

    public void run() {
        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> m = new HashMap<String, Integer>();
        for (int i = 0; i < N; i++) {
            String s = S[i];
            if (m.containsKey(s)) {
                m.put(s, m.get(s) + 1);
            } else {
                m.put(s, 1);
            }
        }

        int max = 0;
        Set<String> set = new TreeSet<String>();
        for (Map.Entry e : m.entrySet()) {
            int cnt = (int) e.getValue();
            if (max < cnt) {
                set.clear();
                max = cnt;
            }
            if (max == cnt) {
                set.add((String)e.getKey());
            }
        }

        for (String s : set) {
            System.out.println(s);
        }

        return;
    }

}

/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