import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
import java.util.Scanner;

public class Main {

    public static void main(String args[]) {

        // 入力
        Scanner sc = new Scanner(System.in);
        Integer n = Integer.parseInt(sc.next());
        String[] s = new String[n];
        for (int i = 0; i < n; i++) {
            s[i] = sc.next();
        }

        // 主処理
        Map<String, Integer> map = new HashMap<>();
        int max = 0;
        List<String> list = new ArrayList<>();
        for (String str : s) {
            if (map.containsKey(str)) {
                map.put(str, map.get(str) + 1);
            } else {
                map.put(str, 1);
            }
            if (max == map.get(str)) {
                list.add(str);
            } else if (max < map.get(str)) {
                list = new ArrayList<>();
                list.add(str);
            }
            max = Math.max(max, map.get(str));
        }
        String[] arr = list.toArray(new String[list.size()]);
        Arrays.sort(arr);

        String result = String.join("\r\n", arr);

        // 出力
        System.out.println(result);
        sc.close();
    }
}

/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