#include <bits/stdc++.h>
template <typename T>
T binpow(T a, T n, T m) {
  T res = 1;
  for (; n > 0; n /= 2) {
    if (n & 1) {
      res = (res * a) % m;
    }
    a = (a * a) % m;
  }
  return res;
}
template <typename T>
std::pair<bool, T> discr_log(T a, T b, T m) {
  T n = (T)std::sqrt(double(m));
  std::map<T, size_t> fn;
  T an0 = binpow(a, n, m);
  T an = an0;
  for (size_t i = 0; i < (m + n - 1) / n; ++i) {
    if (fn.count(an) > 0)
      break;
    else {
      fn[an] = i + 1;
      an = (an * an0) % m;
    }
  }
  T aq = 1;
  for (size_t i = 0; i < n; ++i, aq = (aq * a) % m) {
    if (fn.count((aq * b) % m) > 0) return {true, n * fn[(aq * b) % m] - i};
  }
  return {false, 0};
}
template <typename T>
T first_order_root_prime(T m) {
  T fi = m - 1;
  std::vector<T> p;
  T cur = fi;
  for (size_t i = 2; i * i <= fi; ++i) {
    if (cur % i == 0) {
      p.push_back(fi / i);
      for (; cur % i == 0; cur /= i)
        ;
    }
  }
  if (cur > 1) p.push_back(fi / cur);
  for (T i = 2; i < m; ++i) {
    bool g = true;
    for (size_t j = 0; j < p.size(); ++j)
      if (binpow(i, p[j], m) == 1) {
        g = false;
        break;
      }
    if (g) return i;
  }
  return 0;
}
template <typename T>
std::pair<bool, T> discr_sqrt_prime(T b, T a, T m) {
  T fo = first_order_root_prime(m);
  T c = binpow(fo, b, m);
  std::pair<bool, T> q = discr_log(c, a, m);
  return {q.first, binpow(fo, q.second, m)};
}
template <typename T>
struct matr {
  matr(std::vector<T> const& b, T m_)
      : n(b.size()),
        m(m_),
        a(std::vector<std::vector<T>>(n, std::vector<T>(n, 0))) {
    for (size_t i = 0; i < n; ++i) a[i][0] = b[i];
    for (size_t i = 0; i + 1 < n; ++i) a[i][i + 1] = 1;
  }
  matr(size_t n_, T m_)
      : n(n_), m(m_), a(std::vector<std::vector<T>>(n, std::vector<T>(n, 0))) {}
  matr operator*(matr const& other) {
    matr res(n, m);
    for (size_t i = 0; i < n; ++i)
      for (size_t k = 0; k < n; ++k)
        for (size_t j = 0; j < n; ++j)
          res.a[i][j] = (res.a[i][j] + a[i][k] * other.a[k][j]) % m;
    return res;
  }
  T get(size_t i, size_t j) { return a[i][j]; }
  void print() {
    std::cout << "n = " << n << "\n";
    for (size_t i = 0; i < n; ++i) {
      for (size_t j = 0; j < n; ++j) std::cout << a[i][j] << " ";
      std::cout << "\n";
    }
  }
  matr binpow(T b) {
    matr res(n, m);
    matr c = *this;
    for (size_t i = 0; i < n; ++i) res.a[i][i] = 1;
    for (; b > 0; b /= 2) {
      if (b & 1) {
        res = res * c;
      }
      c = c * c;
    }
    return res;
  }
  int n;
  T m;
  std::vector<std::vector<T>> a;
};
int main() {
  int k;
  const long long MOD = 998244353LL;
  std::cin >> k;
  std::vector<long long> b(k);
  for (int i = 0; i < k; ++i) std::cin >> b[i];
  matr<long long> a(b, MOD - 1);
  long long n, m;
  std::cin >> n >> m;
  matr<long long> c = a.binpow(n - k);
  std::pair<bool, long long> res = discr_sqrt_prime(c.get(0, 0), m, MOD);
  if (res.first)
    std::cout << res.second << "\n";
  else
    std::cout << "-1\n";
}
