#include<iostream>
#include<cstdio>
using namespace std;
long double a[50],l[50];
int n,ans=0;
void dfs(int x,long double s,int q)
{
    if(x==n+1&&q==0)
    {
        return;
    }
    if(x==n+1&&q!=0)
    {
        if((q%2==1)&&(l[(int)q/2+1]>=(long double)s/q))
        {
            ans++;
        }
        if((q%2==0)&&((l[q/2]+l[q/2+1])/2>=(long double)s/q))
        {
            ans++;
        }
        return;
    }
    l[q+1]=a[x];
    dfs(x+1,s+a[x],q+1);
    l[q+1]=0;
    dfs(x+1,s,q);
}
int main()
{
    freopen("hihocoderB.in","r",stdin);
    freopen("hihocoderB.out","w",stdout);
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        cin>>a[i];
    }
    l[1]=a[1];
    dfs(2,a[1],1);
    l[1]=0;
    dfs(2,0,0);
    cout<<ans;
    return 0;
}