Constructor#4976
On her first birthday, Maggie Simpson, a character from the animated series "The Simpsons," received a construction set as a gift. This set consists of sticks of various lengths. The ends of these sticks can be joined together, and sticks connected in this way can form any non-zero angle except a straight angle (180^\circ).
Maggie wants to assemble a convex polygon using as many sticks from the construction set as possible, using the sticks as sides of the polygon.
Write a program that, given the lengths of the sticks in the construction set, determines whether Maggie can form a convex polygon with the sticks, and if so, finds the maximum number of sticks she can use for this purpose.
The first line contains the number (2 \leq N \leq 10^5) — the number of sticks in the set. The second line contains positive integers, each less than 10^9 (not necessarily distinct) — the lengths of the sticks.
Output a single integer — the maximum number of sticks from the set that can be used to form a convex polygon, or if forming a convex polygon is not possible.
Example 1