#include <algorithm>
#include <cassert>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <numeric>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <ranges>
#include <iomanip>
using namespace std;
using ll = long long;

auto range(int n) { return views::iota(0, n); }

template<class T, class U> ostream& operator<<(ostream& os, const pair<T, U>& p){ return os << "{" << p.first << ", " << p.second << "}"; }
template<typename T> ostream& operator<<(ostream& os, const vector<T>& obj) { os << "{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T> ostream& operator<<(ostream& os, const set<T>& obj) { os << "set{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }
template<typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& obj) { os << "map{"; for (const auto& e : obj) os << e << ", "; return os << "}"; }

#ifdef ONLINE_JUDGE
#define dump(expr) ;
#else
#define dump(expr) { cerr << "\033[33m#L" << __LINE__ << ": " << expr << "\033[39m" << endl; }
#endif

const int mod = 1000000007;
struct mint {
  ll x;
  mint(ll x_ = 0) : x((x_ % mod + mod) % mod) {}
  mint operator-() const { return mint(-x); }
  mint &operator+=(const mint &a) { if ((x += a.x) >= mod) x -= mod; return *this; }
  mint &operator-=(const mint &a) { if ((x += mod - a.x) >= mod) x -= mod; return *this; }
  mint &operator*=(const mint &a) { (x *= a.x) %= mod; return *this; }
  mint operator+(const mint &a) const { mint res(*this); return res += a; }
  mint operator-(const mint &a) const { mint res(*this); return res -= a; }
  mint operator*(const mint &a) const { mint res(*this); return res *= a; }
  mint pow(ll t) const { if (!t) return 1; mint a = pow(t >> 1); a *= a; if (t & 1) a *= *this; return a; }
  mint inv() const { return pow(mod - 2); }
  mint &operator/=(const mint &a) { return (*this) *= a.inv(); }
  mint operator/(const mint &a) const { mint res(*this); return res /= a; }
  friend ostream &operator<<(ostream &os, const mint &m) { os << m.x; return os; }
  friend istream &operator>>(istream &is, mint &m) { is >> m.x; return is; }
};

template<typename T>
struct PrefixSum {
  vector<T> sums;
  PrefixSum(vector<T> vs) {
    int n = (int)vs.size();
    sums.resize(n + 1, (T)0);
    for (int i : range(n)) sums[i + 1] = sums[i] + vs[i];
  }

  T sum(int i, int j) {
    // vs[i] + ... + vs[j - 1]
    if (i > j) return (T)0;
    return sums[j + 1] - sums[i];
  }
};

ll solve() {
  int n; cin >> n;
  vector<mint> vs(n);
  for (int i : range(n)) cin >> vs[i].x;

  vector<double> vl(n);
  for (int i : range(n)) vl[i] = log10(vs[i].x);

  PrefixSum psum(vl);

  vector<ll> ws(n + 4);

  for (int i : range(n)) {
    int lo = i, hi = n;
    while (hi - lo > 1) {
      int mid = (lo + hi) / 2;
      if (psum.sum(i, mid) > 9 - 1e-10) {
        hi = mid;
      } else {
        lo = mid;
      }
    }

    // [i, ..., lo]
    int m = lo - i + 1;
    dump(i << " " << m);
    ws[i] += m;
    ws[i + 1] += -1 - m;
    ws[i + 1 + m] += 1;
  }

  dump(ws);

  for (int i : range(n + 3)) ws[i + 1] += ws[i];

  dump(ws);

  for (int i : range(n + 3)) ws[i + 1] += ws[i];

  dump(ws);

  mint res = 1;
  for (int i : range(n)) res *= vs[i].pow(ws[i]);

  return res.x;
}

int main() {
  cout << fixed << setprecision(12);
  cout << solve() << endl;
}