eolymp
Competitions

III Командный Студенческий Чемпионат Урала, Екатеринбург, Март 19 - 20, 1999

Find a multiple

Given n positive integers, each is not greater than 15000. This numbers are not necessarily different (so it may happen that two or more of them will be equal). Your task is to choose a few of given numbers (1fewn) so that the sum of chosen numbers is multiple for n (i.e. n * k = (sum of chosen numbers) for some integer k).

Input

First line contains number n (n10000). Each of next n lines contains one number from the given set.

Output

If the answer can not be found, print 0. Otherwise print the number of the chosen numbers in the first line followed by the chosen numbers themselves (on a separate line each) in arbitrary order.

If there are more than one set of numbers with required properties, print any of them.

Time limit 1 second
Memory limit 128 MiB
Input example #1
5
1
2
3
4
1
Output example #1
2
2
3
Author Dmitry Filimonenkov
Source 1999 III Ural Collegiate Programming Contest, Ekaterinburg, March 19 - 20, Problem E