#include <bits/stdc++.h>
using namespace std;
long long TRE1[4000009];
long long TRE2[4000009];
long long pref[300009];
long long dp[300009];
int PUNKT1[300009];
int PUNKT2[300009];
bool tab1[3][300009];
pair<int,int>tab2[3][300009];
long long mod=1000000000+7;
long long mod2=2000000000+14;
long long t;
long long Przedzial(int l, int p,long long *Tre)
{
    l+=t;
    p+=t;
    int v=1;
    int P=t;
    long long wynik=0;
    while(true)
    {
        if(v*P+P-1<l||l>p)
        {
            v=v/2;
            P=P*2;
            if(v==0){break;}
        }
        else if(v*P==l&&v*P+P-1<=p)
        {
            wynik=(wynik+Tre[v])%mod;
            l+=P;
        }
        else
        {
            if(l<v*P+(P/2))
            {
                v=v*2;
                P=P/2;
            }
            else
            {
                v=v*2+1;
                P=P/2;
            }
        }
    }
    return wynik;
}
void dod(int v, long long dod,long long *Tre)
{
    v+=t;
    while(v!=0)
    {
        Tre[v]=(Tre[v]+dod)%mod;
        v=v/2;
    }
}
int TworzenieDrzewa(int x)
{
    x--;
    int u=1;
    while(x>0)
    {
        x=x/2;
        u=u*2;
    }
    return u;
}
int main()
{ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    ///1=parszyste
    ///2=nieparszyste
    int n;
    cin>>n;
    for(int i=1;i<=n;i++)
    {
        long long x;
        cin>>x;
        pref[i]=(pref[i-1]+x)%mod2;
    }
    vector<pair<int,pair<int,int>>>skal;
    ///{(L v P v PUNKT),{ind,info}}
    ///info1=l i [0]
    ///info2=l i [1]
    ///info3=l i [2]
    ///info4=p i [0]
    ///info5=p i [1]
    ///info6=p i [2]
    ///info7=PUNKT
    for(int i=1;i<=n;i++)
    {
        long long u=pref[i];
        if(pref[i]<mod)
        {///<0,6>
            pair<long long,long long>xd1,xd2,xd3;
            ///xd1,xd2
            ///xd3
            xd1={0,u}; xd2={u+mod+1,mod2-1};
            xd3={u+1,u+mod};
            //cout<<xd1.first<<" "<<xd1.second<<endl;
            //cout<<xd2.first<<" "<<xd2.second<<endl;
            //cout<<xd3.first<<" "<<xd3.second<<endl<<endl;
            if(pref[i]%2==0)
            {///<0,6>parzyste
                tab1[0][i]=0;
                tab1[1][i]=0;
                tab1[2][i]=1;
                skal.push_back({xd1.first,{i,1}});
                skal.push_back({xd2.first,{i,2}});
                skal.push_back({xd3.first,{i,3}});
                skal.push_back({xd1.second,{i,4}});
                skal.push_back({xd2.second,{i,5}});
                skal.push_back({xd3.second,{i,6}});
                skal.push_back({pref[i],{i,7}});
                PUNKT1[i]=0;
            }
            else
            {///<0,6>nieparzyste
                tab1[0][i]=1;
                tab1[1][i]=1;
                tab1[2][i]=0;
                skal.push_back({xd1.first,{i,1}});
                skal.push_back({xd2.first,{i,2}});
                skal.push_back({xd3.first,{i,3}});
                skal.push_back({xd1.second,{i,4}});
                skal.push_back({xd2.second,{i,5}});
                skal.push_back({xd3.second,{i,6}});
                skal.push_back({pref[i],{i,7}});
                PUNKT1[i]=1;
            }
        }
        else
        {///<7,13>
            pair<long long,long long>xd1,xd2,xd3;
            ///xd1,xd2
            ///xd3
            xd1={u-mod+1,u};
            xd2={0,u-mod};xd3={u+1,mod2-1};
            //cout<<xd1.first<<" "<<xd1.second<<endl;
            //cout<<xd2.first<<" "<<xd2.second<<endl;
            //cout<<xd3.first<<" "<<xd3.second<<endl<<endl;
            if(pref[i]%2==0)
            {///<7,13>parzyste
                tab1[0][i]=0;
                tab1[1][i]=1;
                tab1[2][i]=1;
                skal.push_back({xd1.first,{i,1}});
                skal.push_back({xd2.first,{i,2}});
                skal.push_back({xd3.first,{i,3}});
                skal.push_back({xd1.second,{i,4}});
                skal.push_back({xd2.second,{i,5}});
                skal.push_back({xd3.second,{i,6}});
                skal.push_back({pref[i],{i,7}});
                PUNKT1[i]=0;
            }
            else
            {///<7,13>nieparzyste
                tab1[0][i]=1;
                tab1[1][i]=0;
                tab1[2][i]=0;
                skal.push_back({xd1.first,{i,1}});
                skal.push_back({xd2.first,{i,2}});
                skal.push_back({xd3.first,{i,3}});
                skal.push_back({xd1.second,{i,4}});
                skal.push_back({xd2.second,{i,5}});
                skal.push_back({xd3.second,{i,6}});
                skal.push_back({pref[i],{i,7}});
                PUNKT1[i]=1;
            }
        }
    }
    sort(skal.begin(),skal.end());
    int h=0;
    for(int i=0;i<skal.size();i++)
    {
        int ziom=skal[i].first;
        int ind=skal[i].second.first;
        int info=skal[i].second.second;
        if(i!=0&&skal[i-1].first!=ziom)
        {
            h++;
        }
        if(info==1)
        {
            tab2[0][ind].first=h;
        }
        else if(info==2)
        {
            tab2[1][ind].first=h;
        }
        else if(info==3)
        {
            tab2[2][ind].first=h;
        }
        else if(info==4)
        {
            tab2[0][ind].second=h;
        }
        else if(info==5)
        {
            tab2[1][ind].second=h;
        }
        else if(info==6)
        {
            tab2[2][ind].second=h;
        }
        else if(info==7)
        {
            PUNKT2[ind]=h;
        }
    }
    t=TworzenieDrzewa(h+10);
    dod(0,1,TRE1);
    for(int i=1;i<=n;i++)
    {
        if(tab1[0][i]==0)
        {
            dp[i]+=Przedzial(tab2[0][i].first,tab2[0][i].second,TRE1);
        }
        else
        {
            dp[i]+=Przedzial(tab2[0][i].first,tab2[0][i].second,TRE2);
        }
        if(tab1[1][i]==0)
        {
            dp[i]+=Przedzial(tab2[1][i].first,tab2[1][i].second,TRE1);
        }
        else
        {
            dp[i]+=Przedzial(tab2[1][i].first,tab2[1][i].second,TRE2);
        }
        if(tab1[2][i]==0)
        {
            dp[i]+=Przedzial(tab2[2][i].first,tab2[2][i].second,TRE1);
        }
        else
        {
            dp[i]+=Przedzial(tab2[2][i].first,tab2[2][i].second,TRE2);
        }
        dp[i]%=mod;
        if(PUNKT1[i]==0)
        {
            dod(PUNKT2[i],dp[i],TRE1);
        }
        else
        {
            dod(PUNKT2[i],dp[i],TRE2);
        }
    }
    cout<<dp[n]<<endl;
    return 0;
}