68pts求条

#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int N=5e3+10;
const ll MOD=998244353;
ll n,a[N],f[N],g[2*N];
ll qp(ll x){
	ll ans=1,cnt=2;
	while(x){
		if(x&1)ans=ans*cnt;
		ans=ans%MOD;
		cnt=cnt*cnt;
		cnt%=MOD;
		x=x/2;
	}
	return ans;
}
int main(){
	scanf("%lld",&n);
	for(int i=1;i<=n;i++){
		scanf("%lld",&a[i]);
	}
	sort(a+1,a+1+n);
	for(int i=0;i<=10000;i++)g[i]=1;
	for(int i=1;i<=n;i++){
		f[i]=f[i-1];
		f[i]=f[i]+(qp(i-1)-g[a[i]]);
		f[i]%=MOD;
		for(int j=10000;j>=0;j--){
			if(j>=a[i])g[j]+=g[j-a[i]];
		}
	}
	printf("%lld",f[n]);
	return 0;
}