#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  long long a = 0;
  char c = getchar();
  bool f = 0;
  while (!isdigit(c)) {
    if (c == '-') f = 1;
    c = getchar();
  }
  while (isdigit(c)) {
    a = (a << 3) + (a << 1) + (c ^ '0');
    c = getchar();
  }
  return f ? -a : a;
}
const long long MOD = 998244353, G = 3;
long long K;
struct matrix {
  long long a[100][100];
  long long* operator[](long long x) { return a[x]; }
  matrix() { memset(a, 0, sizeof(a)); }
  matrix operator*(matrix b) {
    matrix c;
    for (long long i = 0; i < K; ++i)
      for (long long j = 0; j < K; ++j)
        for (long long k = 0; k < K; ++k)
          c[i][j] = (c[i][j] + a[i][k] * b[k][j]) % (MOD - 1);
    return c;
  }
} S, T;
inline long long gcd(long long a, long long b) {
  long long r = a % b;
  while (r) {
    a = b;
    b = r;
    r = a % b;
  }
  return b;
}
inline long long poww(long long a, long long b, long long mod = MOD) {
  long long times = 1;
  while (b) {
    if (b & 1) times = times * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return times;
}
map<long long, long long> Hash;
inline long long BSGS(long long x) {
  long long t = sqrt(MOD) + 1, times = x;
  for (long long i = 0; i < t; i++) {
    Hash[times] = i;
    times = times * G % MOD;
  }
  times = poww(G, t);
  long long now = times;
  for (long long i = 1; i <= t + 1; i++) {
    if (Hash.count(now)) {
      return i * t - Hash[now];
    }
    now = now * times % MOD;
  }
  return -1;
}
long long phi(long long x) {
  long long times = x;
  for (long long i = 2; i * i <= x; ++i) {
    if (x % i == 0) {
      times = times / i * (i - 1);
      while (x % i == 0) x /= i;
    }
  }
  if (x - 1) times = times / x * (x - 1);
  return times;
}
signed main() {
  K = read();
  for (long long i = 0; i < K; ++i) T[K - i - 1][K - 1] = read() % (MOD - 1);
  long long N = read() - K;
  long long t = BSGS(read());
  for (long long i = 0; i + 1 < K; ++i) T[i + 1][i] = 1;
  S[0][K - 1] = 1;
  while (N) {
    if (N & 1) S = S * T;
    T = T * T;
    N >>= 1;
  }
  long long cur = S[0][K - 1], p = gcd(cur, MOD - 1);
  if (t % p != 0)
    puts("-1");
  else {
    t /= p;
    cur /= p;
    long long mod = (MOD - 1) / p;
    cout << poww(G, poww(cur, phi(mod) - 1, mod) * t % mod);
  }
  return 0;
}
