#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
bool Mbg;
using namespace std;
#define vec vector
#define pb push_back
#define eb emplace_back
#define siz(vec) ((int)(vec).size())
#define all(vec) (vec).begin(),(vec).end()
template<class T>
void operator +=(vec<T> &a,T b){a.push_back(b);}
template<class T>
void operator --(vec<T> &a){a.pop_back();}
#define pii pair<int,int>
#define x first
#define y second
#define mp make_pair
#define exc(exp) if(exp)continue;
#define stop(exp) if(exp)break;
#define ret(exp) if(exp)return;
#define deb(var) cerr<<#var<<'='<<(var)<<"; "
#define debl(var) cerr<<#var<<'='<<(var)<<";\n"
#define ins insert
#define era erase
#define lb lower_bound
#define ub upper_bound
#define int long long
#define inf (long long)(1e18)
template<class T>
bool Min(T &x,T y){return x>y?x=y,1:0;}
template<class T>
bool Max(T &x,T y){return x<y?x=y,1:0;}
const int mod=1e9+7;
void Add(int &x,int y){x=x+y<mod?x+y:x+y-mod;}
void Dec(int &x,int y){x=x>=y?x-y:x-y+mod;}
int fpm(int x,int y){
    int ans=1;for(;y;y>>=1,(x*=x)%=mod)if(y&1)(ans*=x)%=mod;return ans;
}

int n,t[1010];
map<int,map<int,int> > f[1010][2],g[1010][2];
void Add(int FR,int TO,int i,int a,int b,int na,int nb,int c){
    Add(g[i][TO][na][nb],g[i-1][FR][a][b]);
    (f[i][TO][na][nb]+=f[i-1][FR][a][b]+c*g[i-1][FR][a][b])%=mod;
}
void work(){
    cin>>n;
    for(int i=1;i<=n;i++)cin>>t[i];

    g[0][0][56][56]=1;

    int ans=0;
    for(int i=1;i<=n+1;i++){
        for(auto T1:g[i-1][0]){
            int a=T1.x;
            for(auto T2:T1.y){
                int b=T2.x;

                if(i==n+1){
                    Add(ans,f[n][0][a][b]);
                    continue;
                }
                Add(0,0,i,a,b,min(56ll,a+t[i]-t[i-1]),min(56ll,b+t[i]-t[i-1]),0);

                if(b+t[i]-t[i-1]<20){
                    Add(0,0,i,a,b,min(56ll,a+t[i]-t[i-1]),b+t[i]-t[i-1],0);
                }else{
                    if(a+t[i]-t[i-1]<=55){
                        Add(0,1,i,a,b,56,(a+t[i]-t[i-1])-75,2);
                    }else{
                        Add(0,0,i,a,b,min(b+t[i]-t[i-1],56ll),0,2);
                    }
                }
            }
        }
        for(auto T1:g[i-1][1]){
            int a=T1.x;
            for(auto T2:T1.y){
                int b=T2.x;

                if(i==n+1){
                    Add(ans,f[n][1][a][b]);
                    continue;
                }
                Add(1,1,i,a,b,min(56ll,a+t[i]-t[i-1]),min(56ll,b+t[i]-t[i-1]),0);

                if(b+t[i]-t[i-1]<20){
                    Add(1,1,i,a,b,min(56ll,a+t[i]-t[i-1]),b+t[i]-t[i-1],0);
                }else{
                    Add(1,0,i,a,b,min(b+t[i]-t[i-1],56ll),0,2);
                }
            }
        }

    }
    cout<<ans<<'\n';
}
bool Med;
signed main(){
    ios::sync_with_stdio(0),
    cin.tie(0),cout.tie(0);
    int T=1;while(T--)work();
    // cerr<<"Time: "<<clock()<<" ms;\n";
    // cerr<<"Memory: "<<abs(&Med-&Mbg)/1024.0/1024.0<<" MiB.\n";
}
/*
- CONTINUE, NON-STOPPING, FOR THE FAITH
- START TYPING IF YOU DON'T KNOW WHAT TO DO
- STOP TYPING IF YOU DON'T KNOW WHAT YOU'RE DOING
*/