import java.util.*;
import java.math.*;

public class Main {

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

    for (int i = 0; i < n; i++) {
      s[i] = sc.next();
    }

    Arrays.sort(s);

    int[] c = new int[n];
    int max = 0;

    for (int i = 0; i < n-1; i++) {
      if (s[i].equals(s[i+1])) {
        c[i+1] += c[i] + 1;
        max = Math.max(max,c[i+1]);
      }
    }

    for (int i = 0; i < n; i++) {
      if (c[i] == max) {
        System.out.println(s[i]);
      }
    }


  }

}

/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