import java.util.*;

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

        int most = 0;
        for(String n: map.keySet()){
          if(map.get(n) > most)
            most = map.get(n);
        }
        for(String n: map.keySet()){
          if(map.get(n) == most)
            System.out.println(n);
        }
    }
}

/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