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

public class Main {

	public static void main(String[] args) {
		Scanner s = new Scanner(System.in);
		int n = s.nextInt();
		Map<String, Integer> map = new TreeMap<>();
		int max = 0;
		for (int i = 0; i < n; i++) {
			String z = s.next();
			if (map.containsKey(z)) {
				int v = map.get(z) + 1;
				max = Math.max(max, v);
				map.put(z, v);
			}else {
				map.put(z, 1);
				max = Math.max(max, 1);
			}
		}
		for(String k : map.keySet()) {
			if (map.get(k) == max) {
				System.out.println(k);
			}
		}
	}
	
	
}

/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