/**
 * Created at 21:05 on 2020-02-16
 */

import java.io.*;
import java.util.*;

public class Main {

  static FastScanner sc = new FastScanner();
  static Output out = new Output(System.out);

  static final int[] dx = {0, 1, 0, -1};
  static final int[] dy = {-1, 0, 1, 0};

  static final long MOD = (long) (1e9 + 7);
  static final long INF = Long.MAX_VALUE / 2;

  static final int e5 = (int) 1e5;

  public static class Solver {
    public Solver() {

      int N = sc.nextInt();

      CountMap<String> map = new CountMap<String>(0);
      for (int i=0; i<N; i++) {
        String s = sc.next();
        map.add(s, 1);
      }

      long max = 0;
      for (String s: map.keySet()) {
        max = Math.max(max, map.get(s));
      }

      ArrayList<String> list = new ArrayList<String>();
      for (String s: map.keySet()) {
        if (map.get(s) == max) {
          list.add(s);
        }
      }

      Collections.sort(list);

      for (String s: list) {
        out.println(s);
      }

    }

    public class CountMap<K> extends HashMap<K, Long> {

      long initVal;

      public CountMap(long initVal) {
        super();
        this.initVal = initVal;
      }

      public long g(K key) {
        if (containsKey(key)) {
          return get(key);
        } else {
          return initVal;
        }
      }

      public void add(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) + value);
        } else {
          put(key, initVal + value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      }

      public void sub(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) - value);
        } else {
          put(key, initVal - value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      }

      public void mul(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) * value);
        } else {
          put(key, initVal * value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      }

      public void div(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) / value);
        } else {
          put(key, initVal / value);
        }
      }

    }
  }

  public static void main(String[] args) {
    new Solver();
    out.flush();
  }

  static class FastScanner {
    private InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;


    public void load() {
      try {
        in = new FileInputStream(next());
      } catch (Exception e) {
        e.printStackTrace();
      }
    }

    private boolean hasNextByte() {
      if (ptr < buflen) {
        return true;
      } else {
        ptr = 0;
        try {
          buflen = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (buflen <= 0) {
          return false;
        }
      }
      return true;
    }

    private int readByte() {
      if (hasNextByte()) return buffer[ptr++];
      else return -1;
    }

    private static boolean isPrintableChar(int c) {
      return 33 <= c && c <= 126;
    }

    private void skipUnprintable() {
      while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
    }

    public boolean hasNext() {
      skipUnprintable();
      return hasNextByte();
    }

    public String next() {
      if (!hasNext()) throw new NoSuchElementException();
      StringBuilder sb = new StringBuilder();
      int b = readByte();
      while (isPrintableChar(b)) {
        sb.appendCodePoint(b);
        b = readByte();
      }
      return sb.toString();
    }

    public long nextLong() {
      if (!hasNext()) throw new NoSuchElementException();
      long n = 0;
      boolean minus = false;
      int b = readByte();
      if (b == '-') {
        minus = true;
        b = readByte();
      }
      if (b < '0' || '9' < b) {
        throw new NumberFormatException();
      }
      while (true) {
        if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        }
        b = readByte();
      }
    }

    public int nextInt() {
      return (int) nextLong();
    }

    public int[] nextIntArray(int N, boolean oneBased) {
      if (oneBased) {
        int[] array = new int[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      } else {
        int[] array = new int[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      }
    }

    public long[] nextLongArray(int N, boolean oneBased) {
      if (oneBased) {
        long[] array = new long[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      } else {
        long[] array = new long[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      }
    }
  }

  static class Output extends PrintWriter {

    private long startTime;

    public Output(PrintStream ps) {
      super(ps);
    }

    public void print(int[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(long[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(String[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(ArrayList a, String separator) {
      for (int i = 0; i < a.size(); i++) {
        if (i == 0) print(a.get(i));
        else print(separator + a.get(i));
      }
      println();
    }

    public void start() {
      startTime = System.currentTimeMillis();
    }

    public void time(String s) {
      long time = System.currentTimeMillis() - startTime;
      println(s + "(" + time + ")");
    }

  }

} import java.io.*; io.* java import java.util.*; util.* java public class Main {

  static FastScanner sc = new FastScanner();
  static Output out = new Output(System.out);

  static final int[] dx = {0, 1, 0, -1};
  static final int[] dy = {-1, 0, 1, 0};

  static final long MOD = (long) (1e9 + 7);
  static final long INF = Long.MAX_VALUE / 2;

  static final int e5 = (int) 1e5;

  public static class Solver {
    public Solver() {

      int N = sc.nextInt();

      CountMap<String> map = new CountMap<String>(0);
      for (int i=0; i<N; i++) {
        String s = sc.next();
        map.add(s, 1);
      }

      long max = 0;
      for (String s: map.keySet()) {
        max = Math.max(max, map.get(s));
      }

      ArrayList<String> list = new ArrayList<String>();
      for (String s: map.keySet()) {
        if (map.get(s) == max) {
          list.add(s);
        }
      }

      Collections.sort(list);

      for (String s: list) {
        out.println(s);
      }

    }

    public class CountMap<K> extends HashMap<K, Long> {

      long initVal;

      public CountMap(long initVal) {
        super();
        this.initVal = initVal;
      }

      public long g(K key) {
        if (containsKey(key)) {
          return get(key);
        } else {
          return initVal;
        }
      }

      public void add(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) + value);
        } else {
          put(key, initVal + value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      }

      public void sub(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) - value);
        } else {
          put(key, initVal - value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      }

      public void mul(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) * value);
        } else {
          put(key, initVal * value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      }

      public void div(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) / value);
        } else {
          put(key, initVal / value);
        }
      }

    }
  }

  public static void main(String[] args) {
    new Solver();
    out.flush();
  }

  static class FastScanner {
    private InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;


    public void load() {
      try {
        in = new FileInputStream(next());
      } catch (Exception e) {
        e.printStackTrace();
      }
    }

    private boolean hasNextByte() {
      if (ptr < buflen) {
        return true;
      } else {
        ptr = 0;
        try {
          buflen = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (buflen <= 0) {
          return false;
        }
      }
      return true;
    }

    private int readByte() {
      if (hasNextByte()) return buffer[ptr++];
      else return -1;
    }

    private static boolean isPrintableChar(int c) {
      return 33 <= c && c <= 126;
    }

    private void skipUnprintable() {
      while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
    }

    public boolean hasNext() {
      skipUnprintable();
      return hasNextByte();
    }

    public String next() {
      if (!hasNext()) throw new NoSuchElementException();
      StringBuilder sb = new StringBuilder();
      int b = readByte();
      while (isPrintableChar(b)) {
        sb.appendCodePoint(b);
        b = readByte();
      }
      return sb.toString();
    }

    public long nextLong() {
      if (!hasNext()) throw new NoSuchElementException();
      long n = 0;
      boolean minus = false;
      int b = readByte();
      if (b == '-') {
        minus = true;
        b = readByte();
      }
      if (b < '0' || '9' < b) {
        throw new NumberFormatException();
      }
      while (true) {
        if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        }
        b = readByte();
      }
    }

    public int nextInt() {
      return (int) nextLong();
    }

    public int[] nextIntArray(int N, boolean oneBased) {
      if (oneBased) {
        int[] array = new int[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      } else {
        int[] array = new int[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      }
    }

    public long[] nextLongArray(int N, boolean oneBased) {
      if (oneBased) {
        long[] array = new long[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      } else {
        long[] array = new long[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      }
    }
  }

  static class Output extends PrintWriter {

    private long startTime;

    public Output(PrintStream ps) {
      super(ps);
    }

    public void print(int[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(long[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(String[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(ArrayList a, String separator) {
      for (int i = 0; i < a.size(); i++) {
        if (i == 0) print(a.get(i));
        else print(separator + a.get(i));
      }
      println();
    }

    public void start() {
      startTime = System.currentTimeMillis();
    }

    public void time(String s) {
      long time = System.currentTimeMillis() - startTime;
      println(s + "(" + time + ")");
    }

  }

} Main static FastScanner sc = new FastScanner(); sc new FastScanner() static Output out = new Output(System.out); out new Output(System.out) static final int[] dx = {0, 1, 0, -1}; dx {0, 1, 0, -1} 0 1 0 -1 1 static final int[] dy = {-1, 0, 1, 0}; dy {-1, 0, 1, 0} -1 1 0 1 0 static final long MOD = (long) (1e9 + 7); MOD (long) (1e9 + 7) 1e9 7 static final long INF = Long.MAX_VALUE / 2; INF Long.MAX_VALUE / 2 Long.MAX_VALUE Long Long.MAX_VALUE 2 static final int e5 = (int) 1e5; e5 (int) 1e5 public static void main(String[] args) {
    new Solver();
    out.flush();
  } main {
    new Solver();
    out.flush();
  } new Solver() out.flush() out.flush out String[] args args public static class Solver {
    public Solver() {

      int N = sc.nextInt();

      CountMap<String> map = new CountMap<String>(0);
      for (int i=0; i<N; i++) {
        String s = sc.next();
        map.add(s, 1);
      }

      long max = 0;
      for (String s: map.keySet()) {
        max = Math.max(max, map.get(s));
      }

      ArrayList<String> list = new ArrayList<String>();
      for (String s: map.keySet()) {
        if (map.get(s) == max) {
          list.add(s);
        }
      }

      Collections.sort(list);

      for (String s: list) {
        out.println(s);
      }

    }

    public class CountMap<K> extends HashMap<K, Long> {

      long initVal;

      public CountMap(long initVal) {
        super();
        this.initVal = initVal;
      }

      public long g(K key) {
        if (containsKey(key)) {
          return get(key);
        } else {
          return initVal;
        }
      }

      public void add(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) + value);
        } else {
          put(key, initVal + value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      }

      public void sub(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) - value);
        } else {
          put(key, initVal - value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      }

      public void mul(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) * value);
        } else {
          put(key, initVal * value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      }

      public void div(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) / value);
        } else {
          put(key, initVal / value);
        }
      }

    }
  } Solver public Solver() {

      int N = sc.nextInt();

      CountMap<String> map = new CountMap<String>(0);
      for (int i=0; i<N; i++) {
        String s = sc.next();
        map.add(s, 1);
      }

      long max = 0;
      for (String s: map.keySet()) {
        max = Math.max(max, map.get(s));
      }

      ArrayList<String> list = new ArrayList<String>();
      for (String s: map.keySet()) {
        if (map.get(s) == max) {
          list.add(s);
        }
      }

      Collections.sort(list);

      for (String s: list) {
        out.println(s);
      }

    } Solver {

      int N = sc.nextInt();

      CountMap<String> map = new CountMap<String>(0);
      for (int i=0; i<N; i++) {
        String s = sc.next();
        map.add(s, 1);
      }

      long max = 0;
      for (String s: map.keySet()) {
        max = Math.max(max, map.get(s));
      }

      ArrayList<String> list = new ArrayList<String>();
      for (String s: map.keySet()) {
        if (map.get(s) == max) {
          list.add(s);
        }
      }

      Collections.sort(list);

      for (String s: list) {
        out.println(s);
      }

    } int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc CountMap<String> map = new CountMap<String>(0); map new CountMap<String>(0) for (int i=0; i<N; i++) {
        String s = sc.next();
        map.add(s, 1);
      } int i=0; int i=0; i 0 i<N i N i++ i++ i {
        String s = sc.next();
        map.add(s, 1);
      } {
        String s = sc.next();
        map.add(s, 1);
      } String s = sc.next(); s sc.next() sc.next sc map.add(s, 1) map.add map s 1 long max = 0; max 0 for (String s: map.keySet()) {
        max = Math.max(max, map.get(s));
      } String s map.keySet() map.keySet map {
        max = Math.max(max, map.get(s));
      } {
        max = Math.max(max, map.get(s));
      } max = Math.max(max, map.get(s)) max Math.max(max, map.get(s)) Math.max Math max map.get(s) map.get map s ArrayList<String> list = new ArrayList<String>(); list new ArrayList<String>() for (String s: map.keySet()) {
        if (map.get(s) == max) {
          list.add(s);
        }
      } String s map.keySet() map.keySet map {
        if (map.get(s) == max) {
          list.add(s);
        }
      } {
        if (map.get(s) == max) {
          list.add(s);
        }
      } if (map.get(s) == max) {
          list.add(s);
        } map.get(s) == max map.get(s) map.get map s max {
          list.add(s);
        } list.add(s) list.add list s Collections.sort(list) Collections.sort Collections list for (String s: list) {
        out.println(s);
      } String s list {
        out.println(s);
      } {
        out.println(s);
      } out.println(s) out.println out s public class CountMap<K> extends HashMap<K, Long> {

      long initVal;

      public CountMap(long initVal) {
        super();
        this.initVal = initVal;
      }

      public long g(K key) {
        if (containsKey(key)) {
          return get(key);
        } else {
          return initVal;
        }
      }

      public void add(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) + value);
        } else {
          put(key, initVal + value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      }

      public void sub(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) - value);
        } else {
          put(key, initVal - value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      }

      public void mul(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) * value);
        } else {
          put(key, initVal * value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      }

      public void div(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) / value);
        } else {
          put(key, initVal / value);
        }
      }

    } CountMap long initVal; initVal public CountMap(long initVal) {
        super();
        this.initVal = initVal;
      } CountMap {
        super();
        this.initVal = initVal;
      } super() super this.initVal = initVal this.initVal this this.initVal initVal long initVal initVal public long g(K key) {
        if (containsKey(key)) {
          return get(key);
        } else {
          return initVal;
        }
      } g {
        if (containsKey(key)) {
          return get(key);
        } else {
          return initVal;
        }
      } if (containsKey(key)) {
          return get(key);
        } else {
          return initVal;
        } containsKey(key) containsKey key {
          return get(key);
        } return get(key); get(key) get key {
          return initVal;
        } return initVal; initVal K key key public void add(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) + value);
        } else {
          put(key, initVal + value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      } add {
        if (containsKey(key)) {
          put(key, get(key) + value);
        } else {
          put(key, initVal + value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      } if (containsKey(key)) {
          put(key, get(key) + value);
        } else {
          put(key, initVal + value);
        } containsKey(key) containsKey key {
          put(key, get(key) + value);
        } put(key, get(key) + value) put key get(key) + value get(key) get key value {
          put(key, initVal + value);
        } put(key, initVal + value) put key initVal + value initVal value if (get(key) == initVal) {
          remove(key);
        } get(key) == initVal get(key) get key initVal {
          remove(key);
        } remove(key) remove key K key key long value value public void sub(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) - value);
        } else {
          put(key, initVal - value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      } sub {
        if (containsKey(key)) {
          put(key, get(key) - value);
        } else {
          put(key, initVal - value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      } if (containsKey(key)) {
          put(key, get(key) - value);
        } else {
          put(key, initVal - value);
        } containsKey(key) containsKey key {
          put(key, get(key) - value);
        } put(key, get(key) - value) put key get(key) - value get(key) get key value {
          put(key, initVal - value);
        } put(key, initVal - value) put key initVal - value initVal value if (get(key) == initVal) {
          remove(key);
        } get(key) == initVal get(key) get key initVal {
          remove(key);
        } remove(key) remove key K key key long value value public void mul(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) * value);
        } else {
          put(key, initVal * value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      } mul {
        if (containsKey(key)) {
          put(key, get(key) * value);
        } else {
          put(key, initVal * value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      } if (containsKey(key)) {
          put(key, get(key) * value);
        } else {
          put(key, initVal * value);
        } containsKey(key) containsKey key {
          put(key, get(key) * value);
        } put(key, get(key) * value) put key get(key) * value get(key) get key value {
          put(key, initVal * value);
        } put(key, initVal * value) put key initVal * value initVal value if (get(key) == initVal) {
          remove(key);
        } get(key) == initVal get(key) get key initVal {
          remove(key);
        } remove(key) remove key K key key long value value public void div(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) / value);
        } else {
          put(key, initVal / value);
        }
      } div {
        if (containsKey(key)) {
          put(key, get(key) / value);
        } else {
          put(key, initVal / value);
        }
      } if (containsKey(key)) {
          put(key, get(key) / value);
        } else {
          put(key, initVal / value);
        } containsKey(key) containsKey key {
          put(key, get(key) / value);
        } put(key, get(key) / value) put key get(key) / value get(key) get key value {
          put(key, initVal / value);
        } put(key, initVal / value) put key initVal / value initVal value K key key long value value HashMap static class FastScanner {
    private InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;


    public void load() {
      try {
        in = new FileInputStream(next());
      } catch (Exception e) {
        e.printStackTrace();
      }
    }

    private boolean hasNextByte() {
      if (ptr < buflen) {
        return true;
      } else {
        ptr = 0;
        try {
          buflen = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (buflen <= 0) {
          return false;
        }
      }
      return true;
    }

    private int readByte() {
      if (hasNextByte()) return buffer[ptr++];
      else return -1;
    }

    private static boolean isPrintableChar(int c) {
      return 33 <= c && c <= 126;
    }

    private void skipUnprintable() {
      while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
    }

    public boolean hasNext() {
      skipUnprintable();
      return hasNextByte();
    }

    public String next() {
      if (!hasNext()) throw new NoSuchElementException();
      StringBuilder sb = new StringBuilder();
      int b = readByte();
      while (isPrintableChar(b)) {
        sb.appendCodePoint(b);
        b = readByte();
      }
      return sb.toString();
    }

    public long nextLong() {
      if (!hasNext()) throw new NoSuchElementException();
      long n = 0;
      boolean minus = false;
      int b = readByte();
      if (b == '-') {
        minus = true;
        b = readByte();
      }
      if (b < '0' || '9' < b) {
        throw new NumberFormatException();
      }
      while (true) {
        if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        }
        b = readByte();
      }
    }

    public int nextInt() {
      return (int) nextLong();
    }

    public int[] nextIntArray(int N, boolean oneBased) {
      if (oneBased) {
        int[] array = new int[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      } else {
        int[] array = new int[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      }
    }

    public long[] nextLongArray(int N, boolean oneBased) {
      if (oneBased) {
        long[] array = new long[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      } else {
        long[] array = new long[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      }
    }
  } FastScanner private InputStream in = System.in; in System.in System System.in private final byte[] buffer = new byte[1024]; buffer new byte[1024] 1024 private int ptr = 0; ptr 0 private int buflen = 0; buflen 0 public void load() {
      try {
        in = new FileInputStream(next());
      } catch (Exception e) {
        e.printStackTrace();
      }
    } load {
      try {
        in = new FileInputStream(next());
      } catch (Exception e) {
        e.printStackTrace();
      }
    } try {
        in = new FileInputStream(next());
      } catch (Exception e) {
        e.printStackTrace();
      } catch (Exception e) {
        e.printStackTrace();
      } Exception e {
        e.printStackTrace();
      } e.printStackTrace() e.printStackTrace e {
        in = new FileInputStream(next());
      } in = new FileInputStream(next()) in new FileInputStream(next()) private boolean hasNextByte() {
      if (ptr < buflen) {
        return true;
      } else {
        ptr = 0;
        try {
          buflen = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (buflen <= 0) {
          return false;
        }
      }
      return true;
    } hasNextByte {
      if (ptr < buflen) {
        return true;
      } else {
        ptr = 0;
        try {
          buflen = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (buflen <= 0) {
          return false;
        }
      }
      return true;
    } if (ptr < buflen) {
        return true;
      } else {
        ptr = 0;
        try {
          buflen = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (buflen <= 0) {
          return false;
        }
      } ptr < buflen ptr buflen {
        return true;
      } return true; true {
        ptr = 0;
        try {
          buflen = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (buflen <= 0) {
          return false;
        }
      } ptr = 0 ptr 0 try {
          buflen = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        } catch (IOException e) {
          e.printStackTrace();
        } IOException e {
          e.printStackTrace();
        } e.printStackTrace() e.printStackTrace e {
          buflen = in.read(buffer);
        } buflen = in.read(buffer) buflen in.read(buffer) in.read in buffer if (buflen <= 0) {
          return false;
        } buflen <= 0 buflen 0 {
          return false;
        } return false; false return true; true private int readByte() {
      if (hasNextByte()) return buffer[ptr++];
      else return -1;
    } readByte {
      if (hasNextByte()) return buffer[ptr++];
      else return -1;
    } if (hasNextByte()) return buffer[ptr++];
      else return -1; hasNextByte() hasNextByte return buffer[ptr++]; buffer[ptr++] buffer ptr++ ptr return -1; -1 1 private static boolean isPrintableChar(int c) {
      return 33 <= c && c <= 126;
    } isPrintableChar {
      return 33 <= c && c <= 126;
    } return 33 <= c && c <= 126; 33 <= c && c <= 126 33 <= c 33 c c <= 126 c 126 int c c private void skipUnprintable() {
      while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
    } skipUnprintable {
      while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
    } while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; hasNextByte() && !isPrintableChar(buffer[ptr]) hasNextByte() hasNextByte !isPrintableChar(buffer[ptr]) isPrintableChar(buffer[ptr]) isPrintableChar buffer[ptr] buffer ptr ptr++ ptr public boolean hasNext() {
      skipUnprintable();
      return hasNextByte();
    } hasNext {
      skipUnprintable();
      return hasNextByte();
    } skipUnprintable() skipUnprintable return hasNextByte(); hasNextByte() hasNextByte public String next() {
      if (!hasNext()) throw new NoSuchElementException();
      StringBuilder sb = new StringBuilder();
      int b = readByte();
      while (isPrintableChar(b)) {
        sb.appendCodePoint(b);
        b = readByte();
      }
      return sb.toString();
    } next {
      if (!hasNext()) throw new NoSuchElementException();
      StringBuilder sb = new StringBuilder();
      int b = readByte();
      while (isPrintableChar(b)) {
        sb.appendCodePoint(b);
        b = readByte();
      }
      return sb.toString();
    } if (!hasNext()) throw new NoSuchElementException(); !hasNext() hasNext() hasNext throw new NoSuchElementException(); new NoSuchElementException() StringBuilder sb = new StringBuilder(); sb new StringBuilder() int b = readByte(); b readByte() readByte while (isPrintableChar(b)) {
        sb.appendCodePoint(b);
        b = readByte();
      } isPrintableChar(b) isPrintableChar b {
        sb.appendCodePoint(b);
        b = readByte();
      } sb.appendCodePoint(b) sb.appendCodePoint sb b b = readByte() b readByte() readByte return sb.toString(); sb.toString() sb.toString sb public long nextLong() {
      if (!hasNext()) throw new NoSuchElementException();
      long n = 0;
      boolean minus = false;
      int b = readByte();
      if (b == '-') {
        minus = true;
        b = readByte();
      }
      if (b < '0' || '9' < b) {
        throw new NumberFormatException();
      }
      while (true) {
        if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        }
        b = readByte();
      }
    } nextLong {
      if (!hasNext()) throw new NoSuchElementException();
      long n = 0;
      boolean minus = false;
      int b = readByte();
      if (b == '-') {
        minus = true;
        b = readByte();
      }
      if (b < '0' || '9' < b) {
        throw new NumberFormatException();
      }
      while (true) {
        if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        }
        b = readByte();
      }
    } if (!hasNext()) throw new NoSuchElementException(); !hasNext() hasNext() hasNext throw new NoSuchElementException(); new NoSuchElementException() long n = 0; n 0 boolean minus = false; minus false int b = readByte(); b readByte() readByte if (b == '-') {
        minus = true;
        b = readByte();
      } b == '-' b '-' {
        minus = true;
        b = readByte();
      } minus = true minus true b = readByte() b readByte() readByte if (b < '0' || '9' < b) {
        throw new NumberFormatException();
      } b < '0' || '9' < b b < '0' b '0' '9' < b '9' b {
        throw new NumberFormatException();
      } throw new NumberFormatException(); new NumberFormatException() while (true) {
        if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        }
        b = readByte();
      } true {
        if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        }
        b = readByte();
      } if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        } '0' <= b && b <= '9' '0' <= b '0' b b <= '9' b '9' {
          n *= 10;
          n += b - '0';
        } n *= 10 n 10 n += b - '0' n b - '0' b '0' if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        } b == -1 || !isPrintableChar(b) b == -1 b -1 1 !isPrintableChar(b) isPrintableChar(b) isPrintableChar b {
          return minus ? -n : n;
        } return minus ? -n : n; minus ? -n : n minus -n n n {
          throw new NumberFormatException();
        } throw new NumberFormatException(); new NumberFormatException() b = readByte() b readByte() readByte public int nextInt() {
      return (int) nextLong();
    } nextInt {
      return (int) nextLong();
    } return (int) nextLong(); (int) nextLong() nextLong public int[] nextIntArray(int N, boolean oneBased) {
      if (oneBased) {
        int[] array = new int[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      } else {
        int[] array = new int[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      }
    } nextIntArray {
      if (oneBased) {
        int[] array = new int[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      } else {
        int[] array = new int[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      }
    } if (oneBased) {
        int[] array = new int[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      } else {
        int[] array = new int[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      } oneBased {
        int[] array = new int[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      } int[] array = new int[N + 1]; array new int[N + 1] N + 1 N 1 for (int i = 1; i <= N; i++) {
          array[i] = sc.nextInt();
        } int i = 1; int i = 1; i 1 i <= N i N i++ i++ i {
          array[i] = sc.nextInt();
        } {
          array[i] = sc.nextInt();
        } array[i] = sc.nextInt() array[i] array i sc.nextInt() sc.nextInt sc return array; array {
        int[] array = new int[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      } int[] array = new int[N]; array new int[N] N for (int i = 0; i < N; i++) {
          array[i] = sc.nextInt();
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
          array[i] = sc.nextInt();
        } {
          array[i] = sc.nextInt();
        } array[i] = sc.nextInt() array[i] array i sc.nextInt() sc.nextInt sc return array; array int N N boolean oneBased oneBased public long[] nextLongArray(int N, boolean oneBased) {
      if (oneBased) {
        long[] array = new long[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      } else {
        long[] array = new long[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      }
    } nextLongArray {
      if (oneBased) {
        long[] array = new long[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      } else {
        long[] array = new long[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      }
    } if (oneBased) {
        long[] array = new long[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      } else {
        long[] array = new long[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      } oneBased {
        long[] array = new long[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      } long[] array = new long[N + 1]; array new long[N + 1] N + 1 N 1 for (int i = 1; i <= N; i++) {
          array[i] = sc.nextLong();
        } int i = 1; int i = 1; i 1 i <= N i N i++ i++ i {
          array[i] = sc.nextLong();
        } {
          array[i] = sc.nextLong();
        } array[i] = sc.nextLong() array[i] array i sc.nextLong() sc.nextLong sc return array; array {
        long[] array = new long[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      } long[] array = new long[N]; array new long[N] N for (int i = 0; i < N; i++) {
          array[i] = sc.nextLong();
        } int i = 0; int i = 0; i 0 i < N i N i++ i++ i {
          array[i] = sc.nextLong();
        } {
          array[i] = sc.nextLong();
        } array[i] = sc.nextLong() array[i] array i sc.nextLong() sc.nextLong sc return array; array int N N boolean oneBased oneBased static class Output extends PrintWriter {

    private long startTime;

    public Output(PrintStream ps) {
      super(ps);
    }

    public void print(int[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(long[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(String[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(ArrayList a, String separator) {
      for (int i = 0; i < a.size(); i++) {
        if (i == 0) print(a.get(i));
        else print(separator + a.get(i));
      }
      println();
    }

    public void start() {
      startTime = System.currentTimeMillis();
    }

    public void time(String s) {
      long time = System.currentTimeMillis() - startTime;
      println(s + "(" + time + ")");
    }

  } Output private long startTime; startTime public Output(PrintStream ps) {
      super(ps);
    } Output {
      super(ps);
    } super(ps) super ps PrintStream ps ps public void print(int[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    } print {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    } for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      } int i = 0; int i = 0; i 0 i < a.length i a.length a a.length i++ i++ i {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      } {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      } if (i == 0) print(a[i]);
        else print(separator + a[i]); i == 0 i 0 print(a[i]) print a[i] a i print(separator + a[i]) print separator + a[i] separator a[i] a i println() println int[] a a String separator separator public void print(long[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    } print {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    } for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      } int i = 0; int i = 0; i 0 i < a.length i a.length a a.length i++ i++ i {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      } {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      } if (i == 0) print(a[i]);
        else print(separator + a[i]); i == 0 i 0 print(a[i]) print a[i] a i print(separator + a[i]) print separator + a[i] separator a[i] a i println() println long[] a a String separator separator public void print(String[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    } print {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    } for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      } int i = 0; int i = 0; i 0 i < a.length i a.length a a.length i++ i++ i {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      } {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      } if (i == 0) print(a[i]);
        else print(separator + a[i]); i == 0 i 0 print(a[i]) print a[i] a i print(separator + a[i]) print separator + a[i] separator a[i] a i println() println String[] a a String separator separator public void print(ArrayList a, String separator) {
      for (int i = 0; i < a.size(); i++) {
        if (i == 0) print(a.get(i));
        else print(separator + a.get(i));
      }
      println();
    } print {
      for (int i = 0; i < a.size(); i++) {
        if (i == 0) print(a.get(i));
        else print(separator + a.get(i));
      }
      println();
    } for (int i = 0; i < a.size(); i++) {
        if (i == 0) print(a.get(i));
        else print(separator + a.get(i));
      } int i = 0; int i = 0; i 0 i < a.size() i a.size() a.size a i++ i++ i {
        if (i == 0) print(a.get(i));
        else print(separator + a.get(i));
      } {
        if (i == 0) print(a.get(i));
        else print(separator + a.get(i));
      } if (i == 0) print(a.get(i));
        else print(separator + a.get(i)); i == 0 i 0 print(a.get(i)) print a.get(i) a.get a i print(separator + a.get(i)) print separator + a.get(i) separator a.get(i) a.get a i println() println ArrayList a a String separator separator public void start() {
      startTime = System.currentTimeMillis();
    } start {
      startTime = System.currentTimeMillis();
    } startTime = System.currentTimeMillis() startTime System.currentTimeMillis() System.currentTimeMillis System public void time(String s) {
      long time = System.currentTimeMillis() - startTime;
      println(s + "(" + time + ")");
    } time {
      long time = System.currentTimeMillis() - startTime;
      println(s + "(" + time + ")");
    } long time = System.currentTimeMillis() - startTime; time System.currentTimeMillis() - startTime System.currentTimeMillis() System.currentTimeMillis System startTime println(s + "(" + time + ")") println s + "(" + time + ")" time s + "(" + time + ")" s "(" time ")" String s s PrintWriter public class Main {

  static FastScanner sc = new FastScanner();
  static Output out = new Output(System.out);

  static final int[] dx = {0, 1, 0, -1};
  static final int[] dy = {-1, 0, 1, 0};

  static final long MOD = (long) (1e9 + 7);
  static final long INF = Long.MAX_VALUE / 2;

  static final int e5 = (int) 1e5;

  public static class Solver {
    public Solver() {

      int N = sc.nextInt();

      CountMap<String> map = new CountMap<String>(0);
      for (int i=0; i<N; i++) {
        String s = sc.next();
        map.add(s, 1);
      }

      long max = 0;
      for (String s: map.keySet()) {
        max = Math.max(max, map.get(s));
      }

      ArrayList<String> list = new ArrayList<String>();
      for (String s: map.keySet()) {
        if (map.get(s) == max) {
          list.add(s);
        }
      }

      Collections.sort(list);

      for (String s: list) {
        out.println(s);
      }

    }

    public class CountMap<K> extends HashMap<K, Long> {

      long initVal;

      public CountMap(long initVal) {
        super();
        this.initVal = initVal;
      }

      public long g(K key) {
        if (containsKey(key)) {
          return get(key);
        } else {
          return initVal;
        }
      }

      public void add(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) + value);
        } else {
          put(key, initVal + value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      }

      public void sub(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) - value);
        } else {
          put(key, initVal - value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      }

      public void mul(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) * value);
        } else {
          put(key, initVal * value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      }

      public void div(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) / value);
        } else {
          put(key, initVal / value);
        }
      }

    }
  }

  public static void main(String[] args) {
    new Solver();
    out.flush();
  }

  static class FastScanner {
    private InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;


    public void load() {
      try {
        in = new FileInputStream(next());
      } catch (Exception e) {
        e.printStackTrace();
      }
    }

    private boolean hasNextByte() {
      if (ptr < buflen) {
        return true;
      } else {
        ptr = 0;
        try {
          buflen = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (buflen <= 0) {
          return false;
        }
      }
      return true;
    }

    private int readByte() {
      if (hasNextByte()) return buffer[ptr++];
      else return -1;
    }

    private static boolean isPrintableChar(int c) {
      return 33 <= c && c <= 126;
    }

    private void skipUnprintable() {
      while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
    }

    public boolean hasNext() {
      skipUnprintable();
      return hasNextByte();
    }

    public String next() {
      if (!hasNext()) throw new NoSuchElementException();
      StringBuilder sb = new StringBuilder();
      int b = readByte();
      while (isPrintableChar(b)) {
        sb.appendCodePoint(b);
        b = readByte();
      }
      return sb.toString();
    }

    public long nextLong() {
      if (!hasNext()) throw new NoSuchElementException();
      long n = 0;
      boolean minus = false;
      int b = readByte();
      if (b == '-') {
        minus = true;
        b = readByte();
      }
      if (b < '0' || '9' < b) {
        throw new NumberFormatException();
      }
      while (true) {
        if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        }
        b = readByte();
      }
    }

    public int nextInt() {
      return (int) nextLong();
    }

    public int[] nextIntArray(int N, boolean oneBased) {
      if (oneBased) {
        int[] array = new int[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      } else {
        int[] array = new int[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      }
    }

    public long[] nextLongArray(int N, boolean oneBased) {
      if (oneBased) {
        long[] array = new long[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      } else {
        long[] array = new long[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      }
    }
  }

  static class Output extends PrintWriter {

    private long startTime;

    public Output(PrintStream ps) {
      super(ps);
    }

    public void print(int[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(long[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(String[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(ArrayList a, String separator) {
      for (int i = 0; i < a.size(); i++) {
        if (i == 0) print(a.get(i));
        else print(separator + a.get(i));
      }
      println();
    }

    public void start() {
      startTime = System.currentTimeMillis();
    }

    public void time(String s) {
      long time = System.currentTimeMillis() - startTime;
      println(s + "(" + time + ")");
    }

  }

} public class Main {

  static FastScanner sc = new FastScanner();
  static Output out = new Output(System.out);

  static final int[] dx = {0, 1, 0, -1};
  static final int[] dy = {-1, 0, 1, 0};

  static final long MOD = (long) (1e9 + 7);
  static final long INF = Long.MAX_VALUE / 2;

  static final int e5 = (int) 1e5;

  public static class Solver {
    public Solver() {

      int N = sc.nextInt();

      CountMap<String> map = new CountMap<String>(0);
      for (int i=0; i<N; i++) {
        String s = sc.next();
        map.add(s, 1);
      }

      long max = 0;
      for (String s: map.keySet()) {
        max = Math.max(max, map.get(s));
      }

      ArrayList<String> list = new ArrayList<String>();
      for (String s: map.keySet()) {
        if (map.get(s) == max) {
          list.add(s);
        }
      }

      Collections.sort(list);

      for (String s: list) {
        out.println(s);
      }

    }

    public class CountMap<K> extends HashMap<K, Long> {

      long initVal;

      public CountMap(long initVal) {
        super();
        this.initVal = initVal;
      }

      public long g(K key) {
        if (containsKey(key)) {
          return get(key);
        } else {
          return initVal;
        }
      }

      public void add(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) + value);
        } else {
          put(key, initVal + value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      }

      public void sub(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) - value);
        } else {
          put(key, initVal - value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      }

      public void mul(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) * value);
        } else {
          put(key, initVal * value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      }

      public void div(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) / value);
        } else {
          put(key, initVal / value);
        }
      }

    }
  }

  public static void main(String[] args) {
    new Solver();
    out.flush();
  }

  static class FastScanner {
    private InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;


    public void load() {
      try {
        in = new FileInputStream(next());
      } catch (Exception e) {
        e.printStackTrace();
      }
    }

    private boolean hasNextByte() {
      if (ptr < buflen) {
        return true;
      } else {
        ptr = 0;
        try {
          buflen = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (buflen <= 0) {
          return false;
        }
      }
      return true;
    }

    private int readByte() {
      if (hasNextByte()) return buffer[ptr++];
      else return -1;
    }

    private static boolean isPrintableChar(int c) {
      return 33 <= c && c <= 126;
    }

    private void skipUnprintable() {
      while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
    }

    public boolean hasNext() {
      skipUnprintable();
      return hasNextByte();
    }

    public String next() {
      if (!hasNext()) throw new NoSuchElementException();
      StringBuilder sb = new StringBuilder();
      int b = readByte();
      while (isPrintableChar(b)) {
        sb.appendCodePoint(b);
        b = readByte();
      }
      return sb.toString();
    }

    public long nextLong() {
      if (!hasNext()) throw new NoSuchElementException();
      long n = 0;
      boolean minus = false;
      int b = readByte();
      if (b == '-') {
        minus = true;
        b = readByte();
      }
      if (b < '0' || '9' < b) {
        throw new NumberFormatException();
      }
      while (true) {
        if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        }
        b = readByte();
      }
    }

    public int nextInt() {
      return (int) nextLong();
    }

    public int[] nextIntArray(int N, boolean oneBased) {
      if (oneBased) {
        int[] array = new int[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      } else {
        int[] array = new int[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      }
    }

    public long[] nextLongArray(int N, boolean oneBased) {
      if (oneBased) {
        long[] array = new long[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      } else {
        long[] array = new long[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      }
    }
  }

  static class Output extends PrintWriter {

    private long startTime;

    public Output(PrintStream ps) {
      super(ps);
    }

    public void print(int[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(long[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(String[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(ArrayList a, String separator) {
      for (int i = 0; i < a.size(); i++) {
        if (i == 0) print(a.get(i));
        else print(separator + a.get(i));
      }
      println();
    }

    public void start() {
      startTime = System.currentTimeMillis();
    }

    public void time(String s) {
      long time = System.currentTimeMillis() - startTime;
      println(s + "(" + time + ")");
    }

  }

} Main
/**
 * Created at 21:05 on 2020-02-16
 */

import java.io.*;
import java.util.*;

public class Main {

  static FastScanner sc = new FastScanner();
  static Output out = new Output(System.out);

  static final int[] dx = {0, 1, 0, -1};
  static final int[] dy = {-1, 0, 1, 0};

  static final long MOD = (long) (1e9 + 7);
  static final long INF = Long.MAX_VALUE / 2;

  static final int e5 = (int) 1e5;

  public static class Solver {
    public Solver() {

      int N = sc.nextInt();

      CountMap<String> map = new CountMap<String>(0);
      for (int i=0; i<N; i++) {
        String s = sc.next();
        map.add(s, 1);
      }

      long max = 0;
      for (String s: map.keySet()) {
        max = Math.max(max, map.get(s));
      }

      ArrayList<String> list = new ArrayList<String>();
      for (String s: map.keySet()) {
        if (map.get(s) == max) {
          list.add(s);
        }
      }

      Collections.sort(list);

      for (String s: list) {
        out.println(s);
      }

    }

    public class CountMap<K> extends HashMap<K, Long> {

      long initVal;

      public CountMap(long initVal) {
        super();
        this.initVal = initVal;
      }

      public long g(K key) {
        if (containsKey(key)) {
          return get(key);
        } else {
          return initVal;
        }
      }

      public void add(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) + value);
        } else {
          put(key, initVal + value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      }

      public void sub(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) - value);
        } else {
          put(key, initVal - value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      }

      public void mul(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) * value);
        } else {
          put(key, initVal * value);
        }
        if (get(key) == initVal) {
          remove(key);
        }
      }

      public void div(K key, long value) {
        if (containsKey(key)) {
          put(key, get(key) / value);
        } else {
          put(key, initVal / value);
        }
      }

    }
  }

  public static void main(String[] args) {
    new Solver();
    out.flush();
  }

  static class FastScanner {
    private InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;


    public void load() {
      try {
        in = new FileInputStream(next());
      } catch (Exception e) {
        e.printStackTrace();
      }
    }

    private boolean hasNextByte() {
      if (ptr < buflen) {
        return true;
      } else {
        ptr = 0;
        try {
          buflen = in.read(buffer);
        } catch (IOException e) {
          e.printStackTrace();
        }
        if (buflen <= 0) {
          return false;
        }
      }
      return true;
    }

    private int readByte() {
      if (hasNextByte()) return buffer[ptr++];
      else return -1;
    }

    private static boolean isPrintableChar(int c) {
      return 33 <= c && c <= 126;
    }

    private void skipUnprintable() {
      while (hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++;
    }

    public boolean hasNext() {
      skipUnprintable();
      return hasNextByte();
    }

    public String next() {
      if (!hasNext()) throw new NoSuchElementException();
      StringBuilder sb = new StringBuilder();
      int b = readByte();
      while (isPrintableChar(b)) {
        sb.appendCodePoint(b);
        b = readByte();
      }
      return sb.toString();
    }

    public long nextLong() {
      if (!hasNext()) throw new NoSuchElementException();
      long n = 0;
      boolean minus = false;
      int b = readByte();
      if (b == '-') {
        minus = true;
        b = readByte();
      }
      if (b < '0' || '9' < b) {
        throw new NumberFormatException();
      }
      while (true) {
        if ('0' <= b && b <= '9') {
          n *= 10;
          n += b - '0';
        } else if (b == -1 || !isPrintableChar(b)) {
          return minus ? -n : n;
        } else {
          throw new NumberFormatException();
        }
        b = readByte();
      }
    }

    public int nextInt() {
      return (int) nextLong();
    }

    public int[] nextIntArray(int N, boolean oneBased) {
      if (oneBased) {
        int[] array = new int[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      } else {
        int[] array = new int[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextInt();
        }
        return array;
      }
    }

    public long[] nextLongArray(int N, boolean oneBased) {
      if (oneBased) {
        long[] array = new long[N + 1];
        for (int i = 1; i <= N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      } else {
        long[] array = new long[N];
        for (int i = 0; i < N; i++) {
          array[i] = sc.nextLong();
        }
        return array;
      }
    }
  }

  static class Output extends PrintWriter {

    private long startTime;

    public Output(PrintStream ps) {
      super(ps);
    }

    public void print(int[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(long[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(String[] a, String separator) {
      for (int i = 0; i < a.length; i++) {
        if (i == 0) print(a[i]);
        else print(separator + a[i]);
      }
      println();
    }

    public void print(ArrayList a, String separator) {
      for (int i = 0; i < a.size(); i++) {
        if (i == 0) print(a.get(i));
        else print(separator + a.get(i));
      }
      println();
    }

    public void start() {
      startTime = System.currentTimeMillis();
    }

    public void time(String s) {
      long time = System.currentTimeMillis() - startTime;
      println(s + "(" + time + ")");
    }

  }

}
