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

public class Main {

	public static void main(String[] args) {


		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		String[] array = new String[n];
		for(int i= 0; i < n;i++) {
			array[i] = sc.next();
		}
		Arrays.sort(array);
		List<String> answerList = new ArrayList<String>();
		int count = 1;
		int maxCount = 1;
		for(int i = 1;i < n;i++) {
			if(array[i-1].equals(array[i])) {
				count++;
			}else {
				if(count> maxCount) {
					answerList.clear();
					answerList.add(array[i-1]);
					maxCount = count;
					count = 1;
				}else if(count== maxCount) {
					answerList.add(array[i-1]);
					count = 1;
				}else {
					count = 1;
				}
			}
			if(i == n-1) {
				if(count> maxCount) {
					answerList.clear();
					answerList.add(array[i]);
				}else if(count== maxCount) {
					answerList.add(array[i]);
				}
			}
		}


		for(String answer :answerList) {
			System.out.println(answer);
		}
	}

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