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

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int[] a= new int[n];
		String[] s=new String[n];
		int count=0,max=0;;

		for(int i=0;i<n;i++) {
			s[i]=sc.next();
		}
		Arrays.parallelSort(s);
		for(int i=0;i<n-1;i++) {
			if(s[i].equals(s[i+1])) {
				count++;
			}else {
				if(count!=0)count++;
				max=Math.max(count, max);
				count=0;
			}
		}
		if(count!=0) {
			count++;
			max=Math.max(count, max);
		}
		count=0;
		for(int i=0;i<n-1;i++) {
			if(s[i].equals(s[i+1])) {
				count++;
			}else {
				if(count!=0)count++;
				if(count==max) {
					System.out.println(s[i]);
				}
				count=0;
			}
		}
		if(count!=0)count++;
		if(count==max) {
			System.out.println(s[n-1]);
		}
		/*for(String buff:s) {
			System.out.println(buff);
		}
		System.out.println(max+" "+count);*/
	}
}


/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