import java.util.*;
import java.util.Map.Entry;
public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int n = sc.nextInt();
		Map<String, Integer> map = new TreeMap<String, Integer>();
		for(int i=0;i<n;i++) {
			String s = sc.next();
			if(map.containsKey(s))
				map.put(s, map.get(s)+1);
			else
				map.put(s, 1);
		}
		
		int max = 0;
		for(Entry<String, Integer> e: map.entrySet()) {
			String key = e.getKey();
			int vote = e.getValue();
			if(vote>max)
				max = vote;
		}
		
		StringBuilder ans = new StringBuilder();
		for(Entry<String, Integer> e: map.entrySet()) {
			String key = e.getKey();
			int vote = e.getValue();
			if(vote==max)
				ans.append(key+"\n");
		}
		
		System.out.print(ans);
	}
}
/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