Problem:
Score: 300 points

Problem Statement

We have N voting papers. The i-th vote (1 \leq i \leq N) has the string S_i written on it.

Print all strings that are written on the most number of votes, in lexicographical order.

Constraints

1 \leq N \leq 2 \times 10^5

S_i (1 \leq i \leq N) are strings consisting of lowercase English letters.

The length of S_i (1 \leq i \leq N) is between 1 and 10 (inclusive).

Input

Input is given from Standard Input in the following format:

N
S_1
:
S_N

Output

Print all strings in question in lexicographical order.

Sample Input 1

7
beat
vet
beet
bed
vet
bet
beet

Sample Output 1

beet
vet

beet and vet are written on two sheets each, while beat, bed, and bet are written on one vote each. Thus, we should print the strings beet and vet.

Sample Input 2

8
buffalo
buffalo
buffalo
buffalo
buffalo
buffalo
buffalo
buffalo

Sample Output 2

buffalo

Sample Input 3

7
bass
bass
kick
kick
bass
kick
kick

Sample Output 3

kick

Sample Input 4

4
ushi
tapu
nichia
kun

Sample Output 4

kun
nichia
tapu
ushi

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Time Limit Exceeded)

import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.List;
import java.util.Scanner;
import java.util.Collections;
import java.util.ArrayList;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        abc155_c solver = new abc155_c();
        solver.solve(1, in, out);
        out.close();
    }

    static class abc155_c {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int N = in.nextInt();
            List polly = new ArrayList<Player>();

            for (int i = 0; i < N; i++) {
                String S = in.next();
                int count = 0;
                for (int j = 0; j < polly.size(); j++) {
                    Player item = (Player) polly.get(j);
                    if (S.compareTo(item.getName()) == 0) {
                        item.count = item.getCount() + 1;
                        polly.set(j, item);
                    }
                }
                if (count == 0) {
                    polly.add(new Player(0, S));
                }
            }
            Collections.sort(polly);
            Collections.reverse(polly);
            int tops = 0;
            for (int i = 0; i < polly.size(); i++) {
                Player item;
                item = (Player) polly.get(i);
                if (i == 0) {
                    tops = item.getCount();
                }
                if (tops == item.getCount()) {
                    out.println(item.getName());
                }
            }
        }

        class Player implements Comparable<Player> {
            private int count;
            private String name;

            public Player(int count, String name) {
                this.count = count;
                this.name = name;
            }

            public int compareTo(Player o) {
                if (this.getCount() == o.getCount()) {
                    return o.getName().compareTo(this.getName());
                } else {
                    return (this.getCount() - o.getCount());
                }
            }

            public int getCount() {
                return count;
            }

            public String getName() {
                return name;
            }

            public String toString() {
                return count + " " + name;
            }

        }

    }
}