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

class Solver {
    public void Solve() {
        int n = sc.nextInt();
        String[] str = new String[n];
        for (int i = 0; i < str.length; i++) {
            str[i] = sc.next();
        }
        Arrays.sort(str);
        int max = 0;
        String s = "";
        int cnt = 0;
        for (int i = 0; i < str.length; i++) {
            if (s.equals(str[i])) {
                cnt++;
                max = Math.max(max, cnt);
            } else {
                s = str[i];
                cnt = 0;
            }
        }
        s = "";
        for (int i = 0; i < str.length; i++) {
            if (s.equals(str[i])) {
                cnt++;
            } else {
                s = str[i];
                cnt = 0;
            }
            if (cnt == max) {
                System.out.println(str[i]);
                cnt = 0;
            }
        }
    }

    Scanner sc;

    Solver(Scanner in) {
        this.sc = in;
    }
}

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        Solver s = new Solver(sc);
        s.Solve();
        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