#include <bits/stdc++.h>
using namespace std;
const int32_t inf = 1001001001;
const int64_t infll = 1001001001001001001ll;
const int dx[] = {0, -1, 1, 0, -1, 1, -1, 1},
          dy[] = {-1, 0, 0, 1, -1, -1, 1, 1};
template <typename T>
using vector2d = vector<vector<T>>;
template <typename T>
void sort(vector<T> &v) {
  sort(v.begin(), v.end());
}
template <typename T>
ostream &operator<<(ostream &os, vector<T> &v) {
  os << v[0];
  for (int i = 1; i < v.size(); ++i) os << " " << v[i];
  return os;
}
template <typename T>
istream &operator>>(istream &is, vector<T> &v) {
  for (T &in : v) is >> in;
  return is;
}
template <typename T1, typename T2>
ostream &operator<<(ostream &os, pair<T1, T2> p) {
  os << p.first << " " << p.second;
  return os;
}
template <typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) {
  is >> p.first >> p.second;
  return is;
}
struct IoSetup {
  IoSetup() {
    cin.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;
inline int64_t in() {
  int64_t x = 0;
  cin >> x;
  return x;
}
template <typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {
  return a < b && (a = b, true);
}
template <typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {
  return a > b && (a = b, true);
}
vector<int> eratosthenes(int n) {
  vector<int> res, p(n + 1, 1);
  p[0] = p[1] = 0;
  for (int i = 2; i * i <= n; ++i) {
    if (p[i]) {
      for (int j = 2 * i; j <= n; j += i) {
        p[j] = 0;
      }
    }
  }
  for (int i = 0; i <= n; ++i) {
    if (p[i]) res.push_back(i);
  }
  return p;
}
const int mod = 1e9 + 7;
vector<int> prime = eratosthenes(1000000);
int n;
vector<int> q;
int dp[101010][2];
int dfs(int idx = 1, int pre = 0) {
  if (idx > q.size()) return 0;
  if (idx == q.size()) {
    return 1;
  }
  int &res = dp[idx][pre + 1 == idx];
  if (~res) return res;
  res = 0;
  if (prime[q[idx]] && q[pre] < q[idx]) {
    res += dfs(idx + 2, idx);
    res %= mod;
    res += dfs(idx + 1, idx);
  }
  return res;
}
signed main(int argc, char *argv[]) {
  memset(dp, -1, sizeof dp);
  cin >> n;
  q = vector<int>(n + 1);
  for (int i = 1; i <= n; ++i) cin >> q[i];
  cout << dfs() << endl;
}
