#include <bits/stdc++.h>
using namespace std;
int c[10005] = {0}, bb[10005] = {0}, tmp[20005] = {0};
int k, n, m, b[105];
const int p = 998244353;
void mul(int *a1, int *a2) {
  for (int i = 0; i <= (k << 1); ++i) tmp[i] = 0;
  for (int i = 0; i <= k; ++i) {
    for (int j = 0; j <= k; ++j) {
      tmp[i + j] = (tmp[i + j] + 1ll * a1[i] * a2[j]) % (p - 1);
    }
  }
  for (int i = k << 1; i >= k; --i) {
    for (int j = 0; j < k; ++j) {
      tmp[i - k + j] = (tmp[i - k + j] + 1ll * tmp[i] * b[k - j]) % (p - 1);
    }
    tmp[i] = 0;
  }
  for (int i = 0; i < k; ++i) a1[i] = tmp[i];
}
void poww(int *a1, int t, int *a2) {
  while (t) {
    if (t & 1) mul(a2, a1);
    mul(a1, a1), t >>= 1;
  }
}
int poww_i(int a, int b, int c) {
  a %= c;
  int res = 1;
  while (b) {
    if (b & 1) res = (1ll * res * a) % c;
    a = (1ll * a * a) % c, b >>= 1;
  }
  return res;
}
int extgcd(int a, int b, int &x, int &y) {
  int d = a;
  if (b)
    d = extgcd(b, a % b, y, x), y = y - (a / b) * x;
  else
    x = 1, y = 0;
  return d;
}
int inv(int x, int m) {
  int u, v;
  if (extgcd(x, m, u, v) != 1) return -1;
  return u < 0 ? u + m : u;
}
int BSGS(int y, int z, int m) {
  map<int, int> rec;
  int s = (int)floor(sqrt(m - 1) + 0.5), cur = 1;
  int v = inv(poww_i(y, s, m), m);
  if (v == -1) return -1;
  for (int i = 0; i < s; ++i) rec[cur] = i, cur = 1ll * cur * y % m;
  for (int i = 0; i <= s; ++i) {
    if (rec.count(z)) return i * s + rec[z];
    z = 1ll * z * v % m;
  }
  return -1;
}
int main() {
  scanf("%d", &k);
  for (int i = 1; i <= k; ++i) scanf("%d", &b[i]);
  scanf("%d%d", &n, &m);
  bb[1] = 1, c[0] = 1;
  if (k > 1)
    poww(bb, n - 1, c);
  else
    c[k - 1] = poww_i(b[1], n - 1, p - 1);
  int exp1 = BSGS(3, m, p), u, v;
  int d = extgcd(c[k - 1], p - 1, u, v);
  if (exp1 % d)
    printf("-1\n");
  else {
    u = (u + p - 1) % (p - 1);
    u = 1ll * (exp1 / d) * u % (p - 1);
    printf("%d\n", poww_i(3, u, p));
  }
  return 0;
}
