import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.HashMap;
import java.util.List;
import java.util.Map;
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();
		}
		Arrays.sort(s);
		String name = s[0];
		int count = 0;
		int max = 0;
		Map<String, Integer> lists = new HashMap<String, Integer>();
		for (int i = 0; i < n; i++) {
			if (name.equals(s[i])) {
				count++;
			} else {
				lists.put(name, count);
				count = 1;
				name = s[i];
			}
			max = Math.max(max, count);
		}
		lists.put(name, count);
		List<String> ans = new ArrayList<String>();
		for (String key : lists.keySet()) {
			if (lists.get(key) == max) {
				ans.add(key);
			}
		}
		Collections.sort(ans);
		for(int i=0;i<ans.size();i++) {
			System.out.println(ans.get(i));
		}
	}
}
/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