import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;
import java.util.TreeMap;
import java.util.Map;
 
public class Main {
 
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int ballot = sc.nextInt();  //投票用紙の枚数
		TreeMap<String, Integer> voteMap = new TreeMap<>();
      int voteMax = 0;
 
		for(int i=1 ; i<=ballot ; i++) {
			int count;
			String voteName = sc.next();
 
			if(! voteMap.containsKey(voteName)) {
				count = 1;
				voteMap.put(voteName, count);
			}
			else {
				count = voteMap.get(voteName) + 1;
				voteMap.put(voteName, count);
			}
          
          voteMax = Math.max(voteMax, count);
		}
      
      for (Map.Entry<String, Integer> e : voteMap.entrySet()) {
        if (e.getValue() == voteMax) {
          System.out.println(e.getKey());
        }
      }
	}
}
/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