Little boy Valera studies an algorithm of sorting an integer array. After studying the theory, he went on to the practical tasks. As a result, he wrote a program that sorts an array of *n* integers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> in the non-decreasing order. The pseudocode of the program, written by Valera, is given below. The input of the program gets number *n* and array *a*.

But Valera could have made a mistake, because he hasn't yet fully learned the sorting algorithm. If Valera made a mistake in his program, you need to give a counter-example that makes his program work improperly (that is, the example that makes the program sort the array not in the non-decreasing order). If such example for the given value of *n* doesn't exist, print -1.
You've got a single integer *n* (1 ≤ *n* ≤ 50) — the size of the sorted array.
n = int(input())
a = list(map(int, input().split()))
a.sort()
pre = 0
len_max = 0
height = 0
total = 1
for i in range(1, n):
    if (a[i] != a[i-1]):
        l = i - pre
        pre = i
        total += 1
        if (l > len_max):
            len_max = l
            height = a[i - 1]

if (n - pre > len_max):
    len_max = n - pre

print(len_max, total)

        