PROGRAMMING:Solving mode problem
Given a multiple set s Containing N elements, the number of times each element appears in S is called the multiplicity of the element. The element with the largest multiplicity in a multiple set s is called mode. For example, s = {1, 2, 2, 2, 3, 5}. The mode of multiple set s is 2 and its multiplicity is 3. For a given multiple set s composed of n natural numbers, the mode and multiplicity of s are calculated. If there are multiple modes, please output the smallest one.
###Input format:
The first line of the input data is the number of elements n (n < 1000) in the multiple set s; In the second line, enter n natural numbers with up to 5 digits.
```in
fourteen
1 2 2 2 3 3 5 6 6 5 6 2 7 6
```
###Output format:
The first line of the output data is for the number, and the second line is for the multiplicity.
```out
2 4
```
answer：If there is no answer, please comment
###Input format:
The first line of the input data is the number of elements n (n < 1000) in the multiple set s; In the second line, enter n natural numbers with up to 5 digits.
```in
fourteen
1 2 2 2 3 3 5 6 6 5 6 2 7 6
```
###Output format:
The first line of the output data is for the number, and the second line is for the multiplicity.
```out
2 4
```
answer：If there is no answer, please comment