#include<bits/stdc++.h>
using namespace std;

typedef long long LL;
#define V vector
#define pb push_back
#define all0(x) (x).begin(), (x).end()
#define all1(x) (x).begin() + 1, (x).end()
#define lb lower_bound

const int INF = 2e9 + 10;
const int mod = 1e9 + 7;
mt19937 mrand(chrono::steady_clock::now().time_since_epoch().count());

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n; cin >> n;
    V<int> a(n + 1);
    for(int i = 1; i <= n; i++) cin >> a[i];
    V<int> cnt20(n + 1);
    V<int> cnt75(n + 1);
    V<LL> pow2(n + 1);
    pow2[0] = 1;
    for(int i = 1; i <= n; i++) pow2[i] = pow2[i - 1] * 2 % mod;
    for(int i = 1; i <= n; i++) {
        for(int j = i + 1; j <= n && a[j] - a[i] <= 19; j++) {
            cnt20[i]++;
        }
    }
    for(int i = 1; i <= n; i++) {
        for(int j = i + 1; j <= n && a[j] - a[i] <= 74; j++) {
            cnt75[i]++;
        }
    }

    auto nxt = [&](int x) -> int {
        return lb(a.begin() + 1, a.end(), x + 1) - a.begin();
    };

    auto cnter = [&](int i, int lim) -> int {
        int ans = 0;
        for(int j = i; j <= n && a[j]  <= lim; j++) {
            ans++;
        }
        return ans;
    };

    V<LL> dp(n + 2), cnt(n + 2);
    cnt[n + 1] = 1;
    for(int i = n; i >= 1; i--) {
        cnt[i] = cnt[i + 1] * 2 % mod;

        LL time75 = pow2[cnt75[i]];

        //3
        for(int j = i + 1; j <= n && a[j] - a[i] <= 74; j++) {
            if(a[j] - a[i] <= 19) continue;
            for(int k = j + 1; k <= n && a[k] - a[i] <= 74; k++) {
                if(a[k] - a[j] <= 19) continue;
                int time = cnt20[i] + cnt20[j] + cnt20[k];

                int tmp = 0;
                tmp += cnter(i + 1, min(a[i] + 74, a[i] + 19));
                tmp += cnter(j + 1, min(a[i] + 74, a[j] + 19));
                tmp += cnter(k + 1, min(a[i] + 74, a[k] + 19));
                time75 -= pow2[tmp];

                int fr = nxt(max(a[k] + 19, a[i] + 74));
                dp[i] += (pow2[time]) * ((6 * cnt[fr] + dp[fr]) % mod) % mod;
                if(dp[i] >= mod) dp[i] -= mod;
            }
        }
        //2
        for(int j = i + 1; j <= n && a[j] - a[i] <= 74; j++) {
            if(a[j] - a[i] <= 19) continue;
                int time = cnt20[i] + cnt20[j];

                int tmp = 0;
                tmp += cnter(i + 1, min(a[i] + 74, a[i] + 19));
                tmp += cnter(j + 1, min(a[i] + 74, a[j] + 19));
                time75 -= pow2[tmp];

                int fr = nxt(max(a[j] + 19, a[i] + 74));
                dp[i] += (pow2[time]) * ((4 * cnt[fr] + dp[fr]) % mod) % mod;
                if(dp[i] >= mod) dp[i] -= mod;
        }
        //1
        int time = cnt20[i];
        int fr = nxt(a[i] + 74);
        dp[i] += (pow2[time]) * ((2 * cnt[fr] + dp[fr]) % mod) % mod;
        if(dp[i] >= mod) dp[i] -= mod;

        int tmp = 0;
        tmp += cnter(i + 1, min(a[i] + 74, a[i] + 19));
        time75 -= pow2[tmp];

        //no
        dp[i] += dp[i + 1];
        if(dp[i] >= mod) dp[i] -= mod;
        //75
        time75 %= mod;
        if(time75 < 0) time75 += mod;
        dp[i] += time75 * (6 * cnt[fr] % mod + dp[fr]) % mod;
        if(dp[i] >= mod) dp[i] -= mod;
    }

    cout << dp[1] << endl;

}