#include <bits/stdc++.h>

using namespace std;

constexpr int N = 1e3 + 1, mod = 1e9 + 7;

int c[N], d[N], t[N], p2[N];

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n; cin >> n;
  for (int i = 0; i < n; ++i) cin >> t[i];
  for (int i = 0, f = 1; i < n; ++i) p2[i] = f, f = f * 2 % mod;
  t[n] = 2e9;
  c[0] = 1;
  for (int i = 0; i < n; ++i) {
    c[i + 1] += c[i];
    d[i + 1] += d[i];
    auto skip = [&](int i, int d) { int j = i; while (j < n && t[j] < t[i] + d) ++j; return j; };
    int ii = skip(i, 20), iii = skip(i, 75);
    for (int j = ii; j <= n; ++j) {
      if (t[j] >= t[i] + 35) {
        c[j] = (c[j] + c[i] * 1ull * p2[ii - i - 1]) % mod;
        d[j] = (d[j] + d[i] * 1ull * p2[ii - i - 1] + c[i] * 2ull * p2[ii - i - 1]) % mod;
        break;
      }
      int jj = skip(j, 20);
      for (int k = jj; k <= n; ++k) {
        if (t[k] >= t[i] + 55) {
          c[k] = (c[k] + c[i] * 1ull * p2[ii - i + jj - j - 2]) % mod;
          d[k] = (d[k] + d[i] * 1ull * p2[ii - i + jj - j - 2] + c[i] * 4ull * p2[ii - i + jj - j - 2]) % mod;
          break;
        }
        c[iii] = (c[iii] + c[i] * 1ull * p2[ii - i + jj - j + iii - k - 3]) % mod;
        d[iii] = (d[iii] + d[i] * 1ull * p2[ii - i + jj - j + iii - k - 3] + c[i] * 6ull * p2[ii - i + jj - j + iii - k - 3]) % mod;
      }
    }
  }
  cout << d[n];
}