Candies

Kristian runs a shop that sells candy in prepackaged bags. He has $N$ bags, and bag $i$ holds $B_i$ candies. When a customer asks for exactly $K$ candies, Kristian must hand over a set of whole bags whose candy counts add up to exactly $K$; if no set of bags sums to $K$, he cannot serve that request.

Call a positive integer $K$ servable if some non-empty subset of the bags sums to $K$. The number of distinct options Kristian can offer is the number of distinct servable values $K$.

To please more customers, Kristian opens exactly one bag and changes how many candies it holds. If he opens a bag that currently holds $P$ candies, he may refill it with any positive integer $Q$ of candies. He wants to choose the bag (identified by its current count $P$) and the new amount $Q$ so that the number of distinct options afterwards is as large as possible.

The first line contains one integer $N$ ($2 \le N \le 100$).

The second line contains $N$ integers $B_1, B_2, \dots, B_N$ ($1 \le B_i \le 7000$) separated by single spaces — the number of candies in each bag.

Print two integers $P$ and $Q$ separated by a single space: Kristian should take a bag that currently holds $P$ candies and change its contents to $Q$ candies. $P$ must be equal to one of the $B_i$, and $Q$ must be a positive integer.

If several choices reach the maximum possible number of distinct options, print the one with the smallest $P$; if a tie still remains, print the smallest $Q$. It is guaranteed that at least one such change strictly increases the number of distinct options.