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

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

		Scanner sc = new Scanner(System.in);
//		String s = sc.next();
		int n = sc.nextInt();

		Map<String, Integer> map = new HashMap<>();

		for(int i=0;i<n;i++) {
			String s = sc.next();
			if(!map.containsKey(s)) {
				map.put(s, 1);
			}else {
				int cnt = map.get(s) + 1;
				map.put(s,cnt);
			}
		}

		//TODO mapのキー,値でソートする方法
		int max = 0;
		ArrayList<String> ans = new ArrayList<>();

		for(Entry<String, Integer> m : map.entrySet()) {
			int val = m.getValue();
			if(val >= max) {
				max = val;
			}
		}

		for(Entry<String, Integer> m : map.entrySet()) {
			if(m.getValue() == max) {
				ans.add(m.getKey());
			}
		}

		Collections.sort(ans);

		for(String s:ans) {
			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