#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N=1000100;
const ll inf=1e18;
int n;
ll a[16],dp1[N],dp2[N];
void Solve(){
    for(int i=1;i<=n;++i){
        cin>>a[i];
    }
    int L=1;
    for(int i=1;i<=n;++i){
        L=L/__gcd(L,i)*i;
    }
    for(int i=0;i<L;++i)dp1[i]=0,dp2[i]=inf;
    dp1[0]=dp2[0]=1;
    for(int i=1;i<=n;++i){
        
        for(ll p=1;a[i];p<<=1){
            static ll g1[N],g2[N];
            for(int j=0;j<L;++j)g1[j]=dp1[j],g2[j]=dp2[j];
            ll z=min(p,a[i]);
            a[i]-=z;
            for(int j=0;j<L;++j){
                if(dp1[j]){
                    g1[(j+z*i)%L]=max(g1[(j+z*i)%L],dp1[j]+(j+z*i)/L);
                    g2[(j+z*i)%L]=min(g2[(j+z*i)%L],dp2[j]+(j+z*i)/L);
                }
            }
            for(int j=0;j<L;++j)dp1[j]=g1[j],dp2[j]=g2[j];
        }
    }
    ll ans=0;
    for(int i=0;i<L;++i){
        if(dp1[i])ans+=dp1[i]-dp2[i]+1;
    }
    cout<<ans<<'\n';
}
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    while(cin>>n)Solve();
}