import java.util.Map;
import java.util.Scanner;
import java.util.TreeMap;

public class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int max = 0;
		Map<String, Integer> map = new TreeMap<>();
		for(int i = 0; i < n; i++) {
			String s = sc.next();
			if(map.containsKey(s)) {
				if(max < map.get(s) + 1) {max = map.get(s) + 1;}
				map.put(s, map.get(s) + 1);
			}else {
				if(max < 1) {max = 1;}
				map.put(s, 1);
			}
		}

		for(String key : map.keySet()) {
			if(map.get(key) == max) {
				System.out.println(key);
			}
		}

		sc.close();
	}
}

/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