Problem: In Homer's school, there are n students who love clubs. 

Initially, there are m clubs, and each of the n students is in exactly one club. In other words, there are a_i students in the i-th club for 1 ≤ i ≤ m and a_1+a_2+...+a_m = n.

The n students are so unfriendly that every day one of them (chosen uniformly at random from all of the n students) gets angry. The student who gets angry will do one of the following things. 

  * With probability \frac 1 2, he leaves his current club, then creates a new club himself and joins it. There is only one student (himself) in the new club he creates. 
  * With probability \frac 1 2, he does not create new clubs. In this case, he changes his club to a new one (possibly the same club he is in currently) with probability proportional to the number of students in it. Formally, suppose there are k clubs and there are b_i students in the i-th club for 1 ≤ i ≤ k (before the student gets angry). He leaves his current club, and then joins the i-th club with probability \frac {b_i} {n}. 

We note that when a club becomes empty, students will never join it because any student who gets angry will join an empty club with probability 0 according to the above statement.

Homer wonders the expected number of days until every student is in the same club for the first time.

We can prove that the answer can be represented as a rational number \frac p q with \gcd(p, q) = 1. Therefore, you are asked to find the value of pq^{-1} mod 998 244 353. It can be shown that q mod 998 244 353 ≠ 0 under the given constraints of the problem.

Input

The first line contains an integer m (1 ≤ m ≤ 1000) — the number of clubs initially.

The second line contains m integers a_1, a_2, ..., a_m (1 ≤ a_i ≤ 4 ⋅ 10^8) with 1 ≤ a_1+a_2+...+a_m ≤ 4 ⋅ 10^8, where a_i denotes the number of students in the i-th club initially.

Output

Print one integer — the expected number of days until every student is in the same club for the first time, modulo 998 244 353.

Examples

Input


2
1 1


Output


4


Input


2
1 2


Output


18


Input


3
1 1 1


Output


21


Input


1
400000000


Output


0


Input


10
1 2 3 4 5 6 7 8 9 10


Output


737609878

Note

In the first example, no matter which student gets angry, the two students will become in the same club with probability \frac 1 4. So the expected number of days until every student is in the same club should be 4.

In the second example, we note that in the first day: 

  * The only student in the first club will get angry with probability \frac 1 3. If he gets angry, then he will create a new club and join it with probability \frac 1 2 (In this case, there will be three clubs which have 0, 1, 2 students in it, respectively), leave his current club and join the second club with probability \frac 1 2 ⋅ \frac 2 3 = \frac 1 3, or stay still with probability \frac 1 2 ⋅ \frac 1 3 = \frac 1 6; 
  * Each of the two students in the second club will get angry with probability \frac 1 3. If one of them gets angry, then he will create a new club and join it with probability \frac 1 2, leave his current club and join the second club with probability \frac 1 2 ⋅ \frac 1 3 = \frac 1 6, or stay still with probability \frac 1 2 ⋅ \frac 2 3 = \frac 1 3. 



In the fourth example, there is only one club initially. That is, every student has already been in the same club. So the answer is 0.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#define i64 long long
#define sz(a) int ((a).size())
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b) - 1; i >= (a); --i)
using namespace std;
const int inf32 = 0x3f3f3f3f;
const i64 inf64 = 0x3f3f3f3f3f3f3f3f;

const int M = 998244353;

struct mint {
	int x;
	mint (int x = 0) : x(x) {}
	friend mint operator +
	(const mint a, const mint &b) {
		int x = a.x + b.x;
		return mint (x >= M ? x - M : x);
	}
	friend mint operator - 
	(const mint a, const mint &b) {
		int x = a.x - b.x;
		return mint (x < 0 ? x + M : x);
	}
	friend mint operator *
	(const mint a, const mint &b) {
		return mint (1ll * a.x * b.x % M);
	}
};

int Pw(int a, int x = M - 2, int res = 1) {
	for (; x; x >>= 1, a = (mint (a) * a).x)
		if (x & 1) res = (mint (res) * a).x;
	return res;
}

const int Na = 1e3;
int na, a[Na], m; 
int A, F, G, D; 

int Get(int x) {
	for (; A < x; ++A) {
		D = (D * (m * mint (2) - A)).x;
		F = (F * (mint (m) - A)).x;
		G = (G * (mint (m) - A)).x;
		F = (mint (F) + D).x;
	}
	return (mint (F) * Pw(G)).x;
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> na;
	rep(i, 0, na) {
		cin >> a[i];
		m += a[i];
	}
	A = 1;
	F = M - 2;
	G = 1;
	D = M - 2;
	sort(a, a + na);
	int res = 0;
	rep(i, 0, na) {
		res = (mint (res) + Get(a[i])).x;
	}
	res = (mint (res) - Get(m)).x;
	cout << res << '\n';
	return 0;
}

/*
	* Read Carefully! Multiple cases? Data range?
	* Transformation? Special cases? Brute & Regularities?
	* Don't get stuck! New directions! Record thoughts!
	* Int overflow? Array bounds? N = 1?
*/