#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	vector<int>a(n);
	rep(i, n)cin >> a[i];
	long long sa = 0;
	mint ans = 1;
	rrep(i, n) {
		ans *= pow_mod(a[i], sa, mod);
		sa += a[i];
	}
	vector<long long>v(100005);
	rep(i, n)v[a[i]]++;
	auto vv = convolution_ll(v, v);
	rep(i, n)vv[2 * a[i]]--;
	rep(i, vv.size()) {
		if (0 == vv[i])continue;
		vv[i] /= 2;
		ans *= pow_mod(i, vv[i], mod);
	}
	int mn = a.back();
	vector<pair<double, P>>x;
	rrep(i, n - 1) {
		double d = log(a[i] + mn) + (double)mn * log(a[i]);
		x.push_back({ d,{a[i],mn} });
		chmin(mn, a[i]);
	}
	sort(all(x));
	ans /= x[0].second.first + x[0].second.second;
	ans /= pow_mod(x[0].second.first, x[0].second.second, mod);
	cout << ans.val() << endl;
	return 0;
}