#include<bits/stdc++.h>
#define int long long
using namespace std;

namespace Conv{

typedef long long ll;
const int mod=998244353,N=1050000,g=3,invg=(mod+1)/3;
int wk[N+5],ta[N+5],tb[N+5];
int Power(int x,int y){
	int r=1;
	while(y){
		if(y&1)r=1ll*r*x%mod;
		x=1ll*x*x%mod,y>>=1;
	}
	return r;
}
void DFT(int *a,int n){
	for(int i=n>>1;i;i>>=1){
		int w=Power(g,(mod-1)/(i<<1));
		wk[0]=1;
		for(int j=1;j<i;j++)wk[j]=1ll*wk[j-1]*w%mod;
		for(int j=0;j<n;j+=(i<<1)){
			for(int k=0;k<i;k++){
				int x=a[j+k],y=a[i+j+k],z=x;
				x+=y,(x>=mod&&(x-=mod)),a[j+k]=x;
				z-=y,(z<0&&(z+=mod)),a[i+j+k]=1ll*z*wk[k]%mod;
			}
		}
	}
}
void IDFT(int *a,int n){
	for(int i=1;i<n;i<<=1){
		int w=Power(invg,(mod-1)/(i<<1));
		wk[0]=1;
		for(int j=1;j<i;j++)wk[j]=1ll*wk[j-1]*w%mod;
		for(int j=0;j<n;j+=(i<<1)){
			for(int k=0;k<i;k++){
				int x=a[j+k],y=1ll*a[i+j+k]*wk[k]%mod,z=x;
				x+=y,(x>=mod&&(x-=mod)),a[j+k]=x;
				z-=y,(z<0&&(z+=mod)),a[i+j+k]=z;
			}
		}
	}
	for(int i=0,inv=Power(n,mod-2);i<n;i++)a[i]=1ll*a[i]*inv%mod;
}
vector<int> conv(vector<int> A,vector<int> B){
	int sa=A.size(),sb=B.size();
	vector<int> ret(sa+sb-1);
	int len=1;
	while(len<ret.size())len<<=1;
	for(int i=0;i<len;i++)ta[i]=tb[i]=0;
	for(int i=0;i<sa;i++)ta[i]=A[i];
	for(int i=0;i<sb;i++)tb[i]=B[i];
	DFT(ta,len),DFT(tb,len);
	for(int i=0;i<len;i++)ta[i]=1ll*ta[i]*tb[i]%mod;
	IDFT(ta,len);
	for(int i=0;i<ret.size();i++)ret[i]=ta[i];
	return ret;
}
}
int read(){
	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*10+ch-'0';ch=getchar();}
	return x*f;
}
const int N=1000010,mod=998244353;
int n,m,c[N],d[N],jc[N],iv[N],inv[N],h[N],a[N];
vector<int>f,g;
int ksm(int p,int k){
	int x=1;
	while(k){
		if(k&1)x=x*p%mod;
		p=p*p%mod;
		k>>=1;
	}
	return x;
}
int C(int n,int m){
	if(n<m)return 0;
	return jc[n]*inv[m]%mod*inv[n-m]%mod;
} 
signed main(){
	//ʹÓ÷½·¨£ºConv::conv(A[],B[]) ·µ»Ø A*B£¬ÆäÖÐ A[]£¬B[]£¬·µ»ØÖµµÄϵÊý¾ù´ÓµÍλµ½¸ßλÅÅÁÐ
	//ÒªÇó A ºÍ B µÄ´ÎÊýÖ®ºÍ²»³¬¹ý 1040000£¬ÇÒ A[i],B[i] ÊôÓÚ [0,998244352]
	n=read(),jc[0]=iv[0]=1;
	for(int i=1;i<=n;i++){
		c[read()]++,h[i]=1;
	}
	for(int i=1;i<=n;i++){
		d[c[i]]++;
		jc[i]=jc[i-1]*i%mod;
	} 
	inv[n]=ksm(jc[n],mod-2);
	for(int i=n;i;i--){
		inv[i-1]=inv[i]*i%mod;
		iv[i]=jc[i-1]*inv[i]%mod;
	}
	for(int i=1;i<=n;i++){
		if(d[i]){
			for(int j=1;j<=n;j++){
				h[j]=h[j]*ksm(C(j,i),d[i])%mod;
			}
		}
	}
	int fl=1;
	for(int i=0;i<=n;i++){
		f.push_back(h[i]*inv[i]%mod);
		g.push_back(fl*inv[i]%mod);
		fl=mod-fl;
	}
	f=Conv::conv(f,g);
	fl=1;
	for(int i=0;i<=n;i++){
		a[i]=f[i]*jc[i]%mod*jc[n-i]%mod*fl%mod;
		fl=mod-fl;
	}
	f.clear(),g.clear();
	for(int i=0;i<=n;i++){
		f.push_back(a[i]);
		g.push_back(inv[i]);
	}
	f=Conv::conv(f,g);
	fl=1;
	for(int i=0;i<=n;i++){
		a[i]=f[i]*inv[n-i]%mod*fl%mod;
		fl=mod-fl;
	}
	for(int i=n;i;i--){
		cout<<a[i]<<" ";
	}
}