Task_Most_Frequent

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.Arrays;

public class MostFrequent {
    public static void main(String[] args) throws Exception {

        InputStreamReader r = new InputStreamReader(System.in);
        BufferedReader userInput = new BufferedReader(r);
//        Scanner userInput = new Scanner(System.in);

        String input = userInput.readLine();

        int[] myArray = new int[Integer.parseInt(input)];

        for (int i = 0; i < myArray.length; i++) {
            myArray[i] = Integer.parseInt(userInput.readLine());
        }

        Arrays.sort(myArray);
        int maxNumber = 0;
        int maxCount = 0;
        int currentNumber = myArray[0];
        int currentCount = 0;
        int tmp = 0;


        for (int i = 0; i < myArray.length; i += tmp) {

            for (int j = 0; j < myArray.length; j++) {
                if (myArray[j] < currentNumber) {
                    continue;
                }
                if (currentNumber == myArray[j]) {
                    currentCount++;
                    if (currentCount > maxCount) {
                        maxCount = currentCount;
                        maxNumber = currentNumber;
                    }
                } else {
                    tmp = currentCount;
                    if (tmp == 0) {
                        tmp = 1;
                    }
                    currentNumber = myArray[j];
                    currentCount = 0;
                    break;
                }
            }
        }

        System.out.printf("%d(%d times)", maxNumber, maxCount);

    }
}