A football tournament

Description

Masai School had hosted a Football tournament. You got hold of a profound description of the final match's process. On the whole, there are n lines in that description each of which described one goal. Every goal was marked with the name of the team that had scored it. Write a program to find the name of the team that won the finals. It is guaranteed that the match did not end in a tie.

Input

Input Format

The first line contains an integer n — the number of lines in the description.

Then follow n lines — for each goal the names of the teams that scored it.

Constraints

1 ≤ n ≤ 100

The names are non-empty lines consisting of uppercase letters whose lengths do not exceed 10 symbols. It is guaranteed that the match did not end in a tie and the description contains no more than two different teams.

Output

Print the name of the winning team. We remind you that in football the team that scores more goals is considered the winner.

Sample Input 1 

5
A
ABA
ABA
A
A

Sample Output 1

A

Language: 

Java

 

 

Theme: 

Dark

1

import java.util.Scanner;

2

public class Main {

3

​

4

    public static void main(String[] args) {

5

        Scanner sc = new Scanner(System.in);

6

        int times = sc.nextInt();

7

​

8

        String teamA = "A";

9

        String teamB = "ABC";

10

​

11

        String []array = new String[times];

12

        for (int i = 0 ;i<times;i++){

13

            array[i]= sc.next();

14

            teamA = array[0];

15

            if (array[i]!=teamA){

16

                teamB=array[i];

17

            }

18

        }

19

        int counta= 0;

20

        int countb =0;

21

​

22

        for (int i = 0;i<times;i++){

23

            if (array[i]==teamA){

24

                counta++;

25

            }else {

26

                countb++;

27

            }

28

        }

29

        if (counta>countb){

30

           System.out.println(teamB);

31

        }else {

32

            System.out.println(teamA);

33

        }

34

    }

35

}