#pragma GCC optimize ("O3")
#pragma GCC target ("avx")

#include <cstdio>
#include <cassert>
#include <cmath>
#include <cstring>

#include <iostream>
#include <algorithm>
#include <vector>
#include <map>
#include <set>
#include <functional>
#include <stack>
#include <queue>

#include <tuple>

#define getchar getchar_unlocked
#define putchar putchar_unlocked

#define _rep(_1, _2, _3, _4, name, ...) name
#define rep2(i, n) rep3(i, 0, n)
#define rep3(i, a, b) rep4(i, a, b, 1)
#define rep4(i, a, b, c) for (int i = int(a); i < int(b); i += int(c))
#define rep(...) _rep(__VA_ARGS__, rep4, rep3, rep2, _)(__VA_ARGS__)

using namespace std;

using i8 = signed char;
using i16 = signed short;
using i64 = long long;
using u8 = unsigned char;
using u32 = unsigned;
using u64 = unsigned long long;
using f80 = long double;

const int mod = 1e9 + 7;
const int phi = mod - 1;
const int pisano = 2 * (mod + 1); // p == 3, 7 (mod 10)

i64 get_i64() {
  i64 n; int c;
  while ((c = getchar()) < '0');
  n = c - '0';
  while ((c = getchar()) >= '0') n = n * 10 + c - '0';
  return n;
}

int get_exp() {
  i64 n; int c;
  while ((c = getchar()) < '0');
  n = c - '0';
  while ((c = getchar()) >= '0') {
    if ((n = n * 10 + c - '0') > i64(9e17)) n %= phi;
  }
  return n % phi;
}

int pow_mod(int b, int e) {
  int ret = 1;
  for (; e; e >>= 1, b = i64(b) * b % mod) if (e & 1) ret = i64(ret) * b % mod;
  return ret;
}

const int pre = 1 << 16;
int f1[2 + pre], f21[pre >> 1], f22[pre >> 1];

void init() {
  auto add_mod = [&] (int a, int b) {
    return (a += b - mod) < 0 ? a + mod : a;
  };
  int a = 0, b = 1;
  f1[0] = 0;
  rep(i, 1, 2 + pre) {
    swap(a = add_mod(a, b), b);
    f1[i] = a;
  }
  int x = a = f21[1] = f1[pre - 1];
  int y = b = f22[1] = f1[pre];
  int z = f1[pre + 1];
  rep(i, 2, pre >> 1) {
    int na = (i64(b) * y + i64(a) * x) % mod;
    int nb = (i64(b) * z + i64(a) * y) % mod;
    a = f21[i] = na;
    b = f22[i] = nb;
  }
}

int fib(int n) {
  if (n < pre) return f1[n];
  int q = n >> 16, r = n & (pre - 1);
  if (r == 0) return f22[q];
  else return (i64(f22[q]) * f1[r + 1] + i64(f21[q]) * f1[r]) % mod;
}

void solve() {
  init();
  int N;
  while (~scanf("%d", &N)) {
    int ans = 1;
    rep(i, N) {
      int ind = (get_i64() + 2) % pisano;
      int f = fib(ind);
      if (f == 0) ans = 0;
      int ex = get_exp();
      ans = i64(ans) * pow_mod(f, ex) % mod;
    }
    printf("%d\n", ans);
  }
}

int main() {
  clock_t beg = clock();
  solve();
  clock_t end = clock();
  fprintf(stderr, "%.3f sec\n", double(end - beg) / CLOCKS_PER_SEC);
}