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 C (GCC 5.4.1) (judge verdict: Time Limit Exceeded)

#include<stdio.h>
#include<stdlib.h>
#include<string.h>

struct my_str_list {
	int num;
	char *str;
	struct my_str_list *next;
};

struct my_str_list *list_add_str(struct my_str_list *const head, const char *const str);
int max_my_list(const struct my_str_list * const head);
void print_list(const struct my_str_list * const head, const int max);
void free_my_str_list(const struct my_str_list * const head);

int main() {
	struct my_str_list *list = NULL;
	int n;
	scanf("%d", &n);
	while (n--) {
		char s[11];
		scanf("%s", s);
		list = list_add_str(list, s);
	}
	int max = max_my_list(list);
	print_list(list, max);
	free_my_str_list(list);
}

struct my_str_list *list_add_str(struct my_str_list *const head, const char *const str) {
	if (!head || strcmp(head->str, str) > 0) {
		struct my_str_list *new_component = (struct my_str_list *)malloc(sizeof(struct my_str_list));
		char *newstr = (char *)malloc(11);
		strcpy(newstr, str);
		new_component->num = 1, new_component->str = newstr, new_component->next = head;
		return new_component;
	}
	else if (strcmp(head->str, str) == 0) {
		head->num++;
		return head;
	}
	struct my_str_list *p = head;
	while (p) {
		if (!p->next) {
			struct my_str_list *new_component = (struct my_str_list *)malloc(sizeof(struct my_str_list));
			char *newstr = (char *)malloc(11);
			strcpy(newstr, str);
			new_component->num = 1, new_component->str = newstr, new_component->next = NULL;
			p->next = new_component;
			return head;
		}
		const int diff = strcmp(p->next->str, str);
		if (diff > 0) {
			struct my_str_list *new_component = (struct my_str_list *)malloc(sizeof(struct my_str_list));
			char *newstr = (char *)malloc(11);
			strcpy(newstr, str);
			new_component->num = 1, new_component->str = newstr, new_component->next = p->next;
			p->next = new_component;
			return head;
		}
		else if (diff == 0) {
			p->next->num++;
			return head;
		}
		p = p->next;
		continue;
	}
}

int max_my_list(const struct my_str_list * const head) {
	const struct my_str_list *p = head;
	int max = 0;
	while (p) {
		max = p->num > max ? p->num : max;
		p = p->next;
	}
	return max;
}

void print_list(const struct my_str_list * const head, const int max) {
	const struct my_str_list *p = head;
	while (p) {
		if (p->num == max) {
			puts(p->str);
		}
		p = p->next;
	}
	return;
}

void free_my_str_list(const struct my_str_list * const head) {
	struct my_str_list *p = head, *q;
	while (p) {
		q = p->next;
		free(p->str);
		free(p);
		p = q;
	}
}