C

Problem description

Imagine that you have a twin brother or sister. Having another person that looks exactly like you seems very unusual. It's hard to say if having something of an alter ego is good or bad. And if you do have a twin, then you very well know what it's like.

Now let's imagine a typical morning in your family. You haven't woken up yet, and Mom is already going to work. She has been so hasty that she has nearly forgotten to leave the two of her darling children some money to buy lunches in the school cafeteria. She fished in the purse and found some number of coins, or to be exact, ncoins of arbitrary values a₁, a₂, ..., a_n. But as Mom was running out of time, she didn't split the coins for you two. So she scribbled a note asking you to split the money equally.

As you woke up, you found Mom's coins and read her note. "But why split the money equally?" — you thought. After all, your twin is sleeping and he won't know anything. So you decided to act like that: pick for yourself some subset of coins so that the sum of values of your coins is strictly larger than the sum of values of the remaining coins that your twin will have. However, you correctly thought that if you take too many coins, the twin will suspect the deception. So, you've decided to stick to the following strategy to avoid suspicions: you take the minimum number of coins, whose sum of values is strictly more than the sum of values of the remaining coins. On this basis, determine what minimum number of coins you need to take to divide them in the described manner.

Input

The first line contains integer n (1 ≤ n ≤ 100) — the number of coins. The second line contains a sequence of n integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 100) — the coins' values. All numbers are separated with spaces.

Output

In the single line print the single number — the minimum needed number of coins.

Examples

Input

2
3 3

Output

2

Input

3
2 1 2

Output

2

Note

In the first sample you will have to take 2 coins (you and your twin have sums equal to 6, 0 correspondingly). If you take 1 coin, you get sums 3, 3. If you take 0 coins, you get sums 0, 6. Those variants do not satisfy you as your sum should be strictly more that your twins' sum.

In the second sample one coin isn't enough for us, too. You can pick coins with values 1, 2 or 2, 2. In any case, the minimum number of coins equals 2.

解题思路：题目的意思就是有n块硬币，要求从中挑选出num个硬币，使得其价值总和nowsum刚好大于剩下硬币的价值总和sum，并且num是最小。怎么解决呢？将币值排序（从小到大），然后从后（币值较大的硬币）往前依次取硬币，只要第一次出现nowsum>sum，此时的num就是要取的最小硬币数，小贪心，水过。

AC代码：

#include<bits/stdc++.h>
using namespace std;
int main(){
    int n,a[105],sum=0,num=0,nowsum=0;
    cin>>n;
    for(int i=0;i<n;++i){cin>>a[i];sum+=a[i];}
    sort(a,a+n);
    for(int i=n-1;i>=0;--i){
        nowsum+=a[i];sum-=a[i];num++;
        if(nowsum>sum)break;
    }
    cout<<num<<endl;
    return 0;
}