//#pragma GCC optimize(3,"Ofast","inline")
#include <bits/stdc++.h>
#ifdef ONLINE_JUDGE
//#include <bits/extc++.h>
#else
//#include <ext/rope>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//#include <ext/pb_ds/hash_policy.hpp>
//#include <ext/pb_ds/trie_policy.hpp>
//#include <ext/pb_ds/priority_queue.hpp>
#endif
using namespace std;
//using namespace __gnu_cxx;
//using namespace __gnu_pbds;
const double pi=3.141592653589793238462643383279;
template<class T>inline T Min(register T a,register T b){
    return a<b?a:b;
}
template<class T>inline T Max(register T a,register T b){
    return a>b?a:b;
}
template<class T>inline bool Cmin(register T &a,register T b){
	return a>b?(a=b,true):false;
}
template<class T>inline bool Cmax(register T &a,register T b){
	return a<b?(a=b,true):false;
}
template<class T>inline T Abs(register T a){
    return a>0?a:-a;
}
template<class T>inline T Lowbit(register T x){
    return (x)&(-x);
}
template<class T>inline void Swap(register T &a,register T &b){
    b^=a^=b^=a;
}
template<class T>inline T Gcd(T a,T b){
    return b?Gcd(b,a%b):a;
}
template<class T>inline T Lcm(T a,T b){
    return a*b/Gcd(a,b);
}
template<class T>inline T Exgcd(T a,T b,T &x,T &y){
    if(b==0){
        x=1;
        y=0;
        return a;
    }
    T d=Exgcd(b,a%b,x,y);
    T t=x;
    x=y;
    y=t-a/b*y;
    return d;
}
template<class T>inline T ExExgcd(T a,T b,T &x,T &y,T c){
    if(b==0){
        x=c;
        y=0;
        return a;
    }
    T d=ExExgcd(b,a%b,x,y,c);
    T t=x;
    x=y;
    y=t-a/b*y;
    return d;
}
template<class T>inline T Ksc(T a,T b){
	if(a==0||b==0){
		return 0;
	}
	T ans=0;
	while(b){
		if(b&1){
			ans=a+ans;
		}
		a=a+a;
		b>>=1;
	}
	return ans;
}
template<class T>inline T Ksc(T a,T b,T p){
	if(a==0||b==0){
		return 0;
	}
	T ans=0;
	while(b){
		if(b&1){
			ans=(a+ans)%p;
		}
		a=(a+a)%p;
		b>>=1;
	}
	return ans;
}
template<class T>inline T Ksm(T a,T b,bool f=false){
	if(a==0){
		return 0;
	}
	if(b==0){
		return 1;
	}
    T ans=1;
    while(b){
        if(b&1){
            ans=!f?a*ans:Ksc(a,ans);
        }
        a=!f?a*a:Ksc(a,a);
        b>>=1;
    }
    return ans;
}
template<class T>inline T Ksm(T a,T b,T p,bool f=false){
	if(a==0){
		return 0;
	}
	if(b==0){
		return 1%p;
	}
    T ans=1;
    while(b){
        if(b&1){
            ans=!f?a*ans%p:Ksc(a,ans,p);
        }
        a=!f?a*a%p:Ksc(a,a,p);
        b>>=1;
    }
    return ans;
}
template<class T>inline T Inv(T x,T p){
	return Ksm(x,p-2,p);
}
template<class T>inline T Fac(T n){
    if(n==0){
        return 1;
    }
    long long ans=1;
    for(long long i=1;i<=n;i++){
        ans*=i;
    }
    return ans;
}
template<class T>inline T Fac(T n,T p){
    if(n==0){
        return 1;
    }
    long long ans=1;
    for(long long i=1;i<=n;i++){
        ans=ans*i%p;
    }
    return ans;
}
template<class T>inline long long Onenum(T x,bool f=true){
	return f?__builtin_popcountll(x):__builtin_popcount(x);
}
template<class T>inline long long Lowone(T x,bool f=true){
	return f?__builtin_ffsll(x):__builtin_ffs(x);
}
template<class T>inline long long Oneoddeven(T x,bool f=true){
	return f?__builtin_parityll(x):__builtin_parity(x);
}
template<class T>inline long long Prezero(T x,bool f=true){
	return f?__builtin_clzll(x):__builtin_clz(x);
}
template<class T>inline long long Sufzero(T x,bool f=true){
	return f?__builtin_ctzll(x):__builtin_ctz(x);
}
template<class T>inline bool Isdigit(T ch){
    return ch>='0' && ch<='9';
}
template<class T>inline bool Isletter(T ch){
    return ch>='A' && ch<='Z' || ch>='a' && ch<='z';
}
template<class T>inline void Memset(T *d,long long n,long long s){
    for(long long i=0;i<=s-1;i++){
        d[i]=n;
    }
}
template<class T>inline void debug(T s,string name){
    cout << name << ": " << s << endl;
}
template<class T>inline void bug(T s){
    cout << s << endl;
}
template<class T>inline T Sin(register T degree){
    return sin(degree*(pi/180));
}
template<class T>inline T Cos(register T degree){
    return cos(degree*(pi/180));
}
template<class T>inline T Tan(register T degree){
    return tan(degree*(pi/180));
}
template<class T>inline T Asin(register T degree){
    return asin(degree*(pi/180));
}
template<class T>inline T Acos(register T degree){
    return acos(degree*(pi/180));
}
template<class T>inline T Atan(register T degree){
    return atan(degree*(pi/180));
}
inline int rd(){
    int x=0,f=1;
    char ch=getchar();
    while(ch<'0' || ch>'9'){
        if(ch=='-'){
            f=-1;
        }
        ch=getchar();
    }
    while(ch>='0' && ch<='9'){
        x=(x<<1)+(x<<3)+(ch-'0');
        ch=getchar();
    }
    return x*f;
}
inline long long read(){
    long long x=0,f=1;
    char ch=getchar();
    while(ch<'0' || ch>'9'){
        if(ch=='-'){
            f=-1;
        }
        ch=getchar();
    }
    while(ch>='0' && ch<='9'){
        x=(x<<1)+(x<<3)+(ch-'0');
        ch=getchar();
    }
    return x*f;
}
inline unsigned long long Read(){
    unsigned long long x=0;
	long long f=1;
    char ch=getchar();
    while(ch<'0' || ch>'9'){
        if(ch=='-'){
            f=-1;
        }
        ch=getchar();
    }
    while(ch>='0' && ch<='9'){
        x=(x<<1)+(x<<3)+(ch-'0');
        ch=getchar();
    }
    return x*f;
}
inline bool wrt(int x,char ch='\n'){
	static char buf[64];
    static int len=-1;
    if(x<0){
        putchar('-');
        x=-x;
    }
    do{
        buf[++len]=x%10;
        x/=10;
    }
    while(x);
    while(len>=0){
        putchar(buf[len--]+'0');
    }
    putchar(ch);
    return true;
}
inline bool write(long long x,char ch='\n'){
    static char buf[64];
    static long long len=-1;
    if(x<0){
        putchar('-');
        x=-x;
    }
    do{
        buf[++len]=x%10;
        x/=10;
    }
    while(x);
    while(len>=0){
        putchar(buf[len--]+'0');
    }
    putchar(ch);
    return true;
}
inline bool Write(unsigned long long x,char ch='\n'){
	static char buf[64];
    static long long len=-1;
    if(x<0){
        putchar('-');
        x=-x;
    }
    do{
        buf[++len]=x%10;
        x/=10;
    }
    while(x);
    while(len>=0){
        putchar(buf[len--]+'0');
    }
    putchar(ch);
    return true;
}
inline void OF(string s){
    string IN=s+".in";
    string OUT=s+".out";
    freopen(IN.c_str(),"r",stdin);
    freopen(OUT.c_str(),"w",stdout);
}
inline void CF(string s){
    fclose(stdin);
    fclose(stdout);
}
const long long N=2020;
const long long MOD=998244353;
long long n;
long long buc[N],C[N][N],S[N][N],dp[N][N];
//¼¯ºÏ´óСΪ i,»¹ÓÐj¸öÖµ´óÓÚµÈÓÚiµÄÈËûÓб»°²Åŵ½¶ÓÁÐÀïÃæ 
inline void init(){
	C[0][0]=1;
	for(register int i=1;i<=n;++i){
		C[i][0]=1;
		for(register int j=1;j<=n;++j){
			C[i][j]=(C[i-1][j-1]+C[i-1][j])%MOD;
		}
	}
	for(register int i=0;i<=2000;++i){
		S[i][0]=S[0][i]=1;
	}
	for(register int i=1;i<=n;++i){
		for(register int j=1;i*j<=n;++j){
			S[i][j]=S[i][j-1]*C[i*j-1][i-1]%MOD;
		}
	}
}
int main(){
	n=read();
	init();
	for(register int i=1;i<=n;++i){
		++buc[read()];
	}
	for(register int i=2000;i>=1;--i){
		buc[i]+=buc[i+1];
	}
	dp[2001][0]=1;
	for(register int i=2000;i>=1;--i){
		for(register int j=0;j<=buc[i];++j){
			for(register int k=j,x=0;k>=0;k-=i,++x){
				if(dp[i+1][k]){
					dp[i][j]=(dp[i][j]+dp[i+1][k]*C[buc[i]-k][j-k]%MOD*S[i][x])%MOD;
				}
			}
		}
	}
	return !write(dp[1][n]);
}