import java.util.*;
public class Main{
	public static void main(String args[]){
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int count = 1;
		int max = 0;
		String[] S = new String[N];
		for(int i = 0;i < N;i++){
			S[i] = sc.next();
		}
		Arrays.sort(S);
		Map<String,Integer> map = new TreeMap<>();
		for(int i = 0;i < N - 1;i++){
			if(S[i + 1].equals(S[i])){
				count++;
				if(i == N - 2){
					map.put(S[i],count);
					max = Math.max(max,count);
				}
			}else{
				map.put(S[i],count);
				max = Math.max(max,count);
				count = 1;
				if(i == N - 2){
					map.put(S[i + 1],count);
					max = Math.max(max,count);
				}
			}
		}
		for(String key : map.keySet()){
			if(map.get(key) == max){
				System.out.println(key);
			}
		}
	}
}
/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