#include <bits/stdc++.h>
using namespace std;
const long long p = 998244353, p1 = p - 1;
long long k, n, fn, f[111], b[111];
long long mod_pow(long long a, long long k, long long MOD);
vector<long long> factor(long long n) {
  vector<long long> res;
  for (long long i = 2; i * i <= n; i++) {
    if (n % i == 0) {
      res.push_back(i);
      if (i * i != n) {
        res.push_back(n / i);
      }
    }
  }
  return res;
}
bool is_primitive_root(long long g, long long n) {
  auto fc = factor(n - 1);
  for (auto x : fc) {
    if (mod_pow(g, x, n) <= 1) return false;
  }
  return true;
}
long long primitive_root(long long n) {
  while (1) {
    long long g = rand() % (n - 1) + 1;
    if (is_primitive_root(g, n)) return g;
  }
  return -1;
}
long long g;
void gcd(long long a, long long b, long long &d, long long &x, long long &y) {
  if (!b) {
    d = a;
    x = 1;
    y = 0;
  } else {
    gcd(b, a % b, d, y, x);
    y -= x * (a / b);
  }
}
long long inv(long long a, long long n) {
  long long d, x, y;
  gcd(a, n, d, x, y);
  return d == 1 ? (x + n) % n : -1;
}
long long mod_pow(long long a, long long k, long long MOD) {
  long long res = 1;
  while (k) {
    if (k & 1) res = res * a % MOD;
    a = a * a % MOD;
    k /= 2;
  }
  return res;
}
long long mod_log(long long a, long long b, long long n) {
  long long m = sqrt(n + 0.5), v = inv(mod_pow(a, m, n), n), e = 1;
  map<long long, long long> x;
  x[1] = 0;
  for (long long i = 1; i < m; i++) {
    e = e * a % n;
    if (!x.count(e)) x[e] = i;
  }
  for (long long i = 0; i < m; i++) {
    if (x.count(b)) return i * m + x[b];
    b = b * v % n;
  }
  return -1;
}
vector<vector<long long> > mul(vector<vector<long long> > &A,
                               vector<vector<long long> > &B) {
  vector<vector<long long> > C(::k, vector<long long>(::k));
  for (int i = 0; i < ::k; i++) {
    for (int k = 0; k < ::k; k++) {
      for (int j = 0; j < ::k; j++) {
        C[i][j] = (C[i][j] + A[i][k] * B[k][j]) % p1;
      }
    }
  }
  return C;
}
vector<vector<long long> > pow(vector<vector<long long> > A, long long n) {
  vector<vector<long long> > B(k, vector<long long>(k));
  for (int i = 0; i < k; i++) B[i][i] = 1;
  while (n) {
    if (n & 1) B = mul(B, A);
    A = mul(A, A);
    n >>= 1;
  }
  return B;
}
long long mod_fun(long long a, long long b, long long n) {
  long long x, y, d;
  gcd(a, n, d, x, y);
  if (b % d) return -1;
  x = x * (b / d) % n;
  x = (x + n) % n;
  return (x % (n / d) + (n / d)) % (n / d);
}
int main() {
  srand(time(NULL));
  ios::sync_with_stdio(0);
  cin >> k;
  for (int i = 0; i < k; i++) cin >> b[i];
  cin >> n >> fn;
  g = primitive_root(p);
  long long hn = mod_log(g, fn, p);
  vector<vector<long long> > A(k, vector<long long>(k));
  for (int i = 0; i < k; i++) A[0][i] = b[i] % p1;
  for (int i = 1; i < k; i++) A[i][i - 1] = 1;
  A = pow(A, n - k);
  long long c = A[0][0];
  long long hk = mod_fun(c, hn, p1);
  if (hk < 0) {
    cout << -1 << endl;
    return 0;
  }
  long long fk = mod_pow(g, hk, p);
  cout << fk << endl;
  return 0;
}
