There are n types of cakes in the confectionery factory, i-th kind of cakes in the factory ai pieces. It was decided to take the cakes for sale to the fair, but the director of the factory decided that the confectionery products on the fair showcase should be laid out in the same rows, At the same time, there should be the same number of cakes of each type. It is not necessary to bring all types of cakes to the fair, you can choose some types and take the same number of cakes of each selected type.
Help the director to take the largest number of cakes to the fair - find out how many types of cakes and how many cakes of each type you need to take to the fair.
Input data format
The first line of the input contains the number n - the number of types of cakes in the factory, 1 <= n <= 10
5.
The next n lines contain one integer each ai - the number of cakes of the i-th kind, 1 <= ai <= 10
5.
The sum of all values of ai does not exceed 2 x 10
9.
Output data format
The program should output two integers. The first number is equal to the number of types of cakes you need to choose for the fair. The second number is equal to the number of cakes of each selected type that need to be taken to the fair.
If there are several possible answers, print any of them.
| Input |
Output |
3
4
10
7 |
2 7 |
Explanation for example. There are 3 types of cakes in the amount of 4, 10 and 7 pieces. The best answer will be if you take 7 cakes of the second and third types.