#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=1000+5,M=N*2+5,K=1e7+5,mod=1e9+7,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,A[N];
ll f[N][21][56],g[N][21][56];
ll pw[N];
void Solve(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%d",&A[i]);
	for(int i=pw[0]=1;i<=n;i++) pw[i]=pw[i-1]*2%mod;
	A[n+1]=A[n]+100;
	f[1][0][0]=0;g[1][0][0]=1;
	for(int i=1;i<=n;i++){
		for(int x=0;x<=20;x++) for(int y=0;y<=55;y++) if(f[i][x][y]||g[i][x][y]){
			(f[i+1][max(0,x-1)][max(0,y-1)]+=f[i][x][y])%=mod;
			(g[i+1][max(0,x-1)][max(0,y-1)]+=g[i][x][y])%=mod;
			int z=i+1;
			while(A[z]-A[i]<20) z++;
			z=max(z,i+x);
			int v=i+1;
			while(A[v]-A[i]<75) v++;
			(f[z][max(0,y+i-z)][max(v-z,0)]+=(f[i][x][y]+g[i][x][y])*pw[z-i-1])%=mod;
			(g[z][max(0,y+i-z)][max(v-z,0)]+=g[i][x][y]*pw[z-i-1])%=mod;
		}
	}
	printf("%lld\n",f[n+1][0][0]%mod*2%mod);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}