import java.util.ArrayList;
import java.util.Collections;
import java.util.HashMap;
import java.util.Map.Entry;
import java.util.Scanner;

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

	    Scanner sc = new Scanner(System.in);
	    int N = sc.nextInt();
	    String[] S = new String[N];
	    for (int i = 0; i < N; i++) {
	    	S[i] = sc.next();
	    }

	    int max = 0;
	    HashMap<String, Integer> map = new HashMap<>();
	    for ( int i = 0; i < N; i++) {
	    	Integer count = map.get(S[i]);
	    	if (count == null) {
	    		count = 1;
	    	} else {
	    		count++;
	    	}

	    	map.put(S[i], count);

	    	if (count > max) {
	    		max = count;
	    	}
	    }

	    ArrayList<String> list = new ArrayList<>();
	    for (Entry<String, Integer> entry : map.entrySet()) {
	    	if (entry.getValue() == max) {
	    		list.add(entry.getKey());
	    	}
	    }

	    Collections.sort(list);

	    for (String s : list) {
	    	System.out.println(s);
	    }

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