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

public class Main {

	public static void main(String[] args) {
		// 自分の得意な言語で
		// Let's チャレンジ！！
		// APPROVED
		// DENIED

		Scanner sc = new Scanner(System.in);

		int n = sc.nextInt();

		int max = 1;
		String w = "";
		Map<String, Integer> map = new HashMap<>();
		List<String> strArr = new ArrayList<>();
		for (int i = 0; i < n; i++) {
			w = sc.next();
			if (map.get(w) == null) {
				map.put(w, 1);
			} else {
				map.put(w, map.get(w) + 1);
				if (map.get(w) > max) {
					max = map.get(w);
				}
			}
		}
		for (Entry<String, Integer> entry : map.entrySet()) {
			if (entry.getValue() == max) {
				strArr.add(entry.getKey());
			}
		}
		Collections.sort(strArr);

		for (String str : strArr) {
			System.out.println(str);
		}

	}

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