import java.io.FileNotFoundException;
import java.util.ArrayList;
import java.util.Collections;
import java.util.LinkedHashMap;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) throws FileNotFoundException {

		//    	File file = new File("src/in.txt");
		//    	Scanner sc = new Scanner(file);

		Scanner sc = new Scanner(System.in);

		int N = sc.nextInt();
		LinkedHashMap<String, Long> map = new LinkedHashMap<String, Long>();
		long max = 0;
		for (int i=0;i<N;i++) {
			String S = sc.next();
		    if (map.containsKey(S)) {
		        map.put(S, map.get(S) + 1);
		        if(max<map.get(S)) {
		        	max = map.get(S);
		        }
		    } else {
		        map.put(S, (long) 1);
		        if(max<1) {
		        	max=1;
		        }
		    }
		}
		ArrayList<String> s = new ArrayList<String>();
		for(String S :map.keySet()) {
			if(map.get(S)==max) {
				s.add(S);
			}
		}
		Collections.sort(s);
		for(String x : s) {
			System.out.println(x);
		}
	}
}
/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