import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Map;
import java.util.Map.Entry;
import java.util.TreeMap;

public class Main {
  public static void main(String[] args) throws Exception {
    
    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
    BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
    
    int n = Integer.parseInt(br.readLine());
    String s;
    Map<String, Integer> map = new TreeMap<>();
    int max = 0;
    for(int i=0; i<n; i++) {
      s = br.readLine();
      int val = map.containsKey(s) ? map.get(s) + 1:1;
      map.put(s, val);
      max = Math.max(max,val);
    }
    
    br.close();
    
    for(Entry<String, Integer> entry : map.entrySet()) {
      if(entry.getValue() == max)
        bw.write(entry.getKey() + "\n");
    }
    
    bw.flush();
    
  }
}
/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