Find a multiple#5621
Sign in

Find a multiple

1 second
128 megabytes
Easy

There are positive integers, some of them may be equal. Select f~(1 \le f \le n) of them in such a way that their sum is divisible by , that is, there exists an integer such that

n \cdot k = \text{(sum of the selected numbers)}

Input

The first line contains the number of integers n~(n \le 10000). Each of the following lines contains one integer not greater than .

Output

If no such subset of numbers exists, print .

Otherwise, print the number of selected integers in the first line, followed by the selected numbers themselves (one per line) in any order. If there are multiple suitable subsets, print any of them.

Examples

Example 1

Loading
Loading