#include <bits/stdc++.h>

using namespace std;

using E = array<int, 4>;

constexpr E exps{61, 59, 53, 47};
constexpr int N = 3e5 + 1;

unordered_map<uint64_t, unordered_map<uint64_t, unordered_map<uint64_t, unordered_map<uint64_t, vector<int>>>>> m;

vector<int> ls[N];

template <int i = 0>
auto& mget(const E& e, auto& m) {
  if constexpr (i == exps.size()) return m;
  else return mget<i + 1>(e, m[e[i]]);
}

template <int i = 0>
void walk(const E& e, auto& m, auto f) {
  if constexpr (i == exps.size()) f(m);
  else for (int j = 0; j < exps[i]; ++j) {
    auto it = m.find((e[i] + (1ull << exps[i]) - 1 - (1ull << j)) % ((1ull << exps[i]) - 1));
    if (it != m.end()) walk<i + 1>(e, it->second, f);
  }
}

int dp[N];

int main() {
  cin.tie(0)->sync_with_stdio(0);
  int n; cin >> n;
  E ps{};
  for (int i = 0; ; ++i) {
    mget(ps, m).push_back(i);
    walk(ps, m, [i](auto& v) { ls[i].insert(ls[i].end(), v.begin(), v.end()); });
    if (i == n) break;
    int v; cin >> v;
    for (int j = 0; j < exps.size(); ++j) ps[j] = (ps[j] + (1ull << v % exps[j])) % ((1ull << exps[j]) - 1);
  }
  dp[0] = 1;
  for (int i = 1; i <= n; ++i)
  for (auto j: ls[i]) dp[i] = (dp[i] + dp[j]) % ((int)1e9 + 7);
  cout << dp[n];
}