#include<bits/stdc++.h>
using namespace std;
namespace polynomial{
	const int MOD=998244353,G=3,IG=(MOD+1)/G,I2=(MOD+1)/2;
	typedef std::vector<int> poly;
	std::ostream &operator<<(std::ostream &str,poly a)
	{
		for(auto i:a) str<<i<<" ";
		return str;
	}
	int qpow(int a,int b) {if(b==0)return 1;int g=qpow(a,b/2);g=1ll*g*g%MOD;if(b&1)g=1ll*g*a%MOD;return g;}
	inline poly operator +(const poly &a,const poly &b) 
	{
		poly c(std::max(a.size(),b.size()));
		for(int i=0;i<(int)std::max(a.size(),b.size());i++)
		{
			int t=0;
			if(i<(int)a.size()) t+=a[i];
			if(i<(int)b.size()) t+=b[i];
			if(t>=MOD) t-=MOD;
			c[i]=t;
		}
		return c;
	}
	inline poly &operator +=(poly &a,const poly &b){return a=a+b;}
	inline poly operator +(poly a,int b)
	{
		a[0]=((a[0]+b)%MOD+MOD)%MOD;
		return a;
	}
	inline poly &operator +=(poly &a,const int &b){return a=a+b;}
	inline poly operator -(const poly &a,const poly &b)
	{
		poly c(std::max(a.size(),b.size()));
		for(int i=0;i<(int)std::max(a.size(),b.size());i++)
		{
			int t=0;
			if(i<(int)a.size()) t+=a[i];
			if(i<(int)b.size()) t-=b[i];
			if(t>=MOD) t-=MOD;
			if(t<0) t+=MOD;
			c[i]=t;
		}
		return c;
	}
	inline poly &operator -=(poly &a,const poly &b){return a=a-b;}
	inline poly operator -(poly a)
	{
		for(auto &i:a) i=MOD-i;
		return a;
	}
	inline poly operator -(const poly &a,int b)
	{
		return a+-b;
	}
	inline poly &operator -=(poly &a,int b) {return a=a-b;}
	inline poly operator -(int a,const poly &b) {return (-b)+a;}
	inline void ntt(poly &a,const std::vector<int> &rev,int lim,const int &iv)
	{
		for(int i=0;i<lim;i++)
		{
			if(i<rev[i]) std::swap(a[i],a[rev[i]]);
		}
		int in=qpow(lim,MOD-2);
		for(int len=1;len<lim;len<<=1)
		{
			int w=qpow(iv==1?IG:G,(MOD-1)/(len<<1));
			for(int i=0;i<lim;i+=len<<1)
			{		
				int pw=1;
				for(int j=0;j<len;j++)
				{
					int x=a[i+j],y=1ll*pw*a[i+j+len]%MOD;
					a[i+j]=x+y;
					if(a[i+j]>=MOD) a[i+j]-=MOD;
					a[i+j+len]=x-y;
					if(a[i+j+len]>=MOD) a[i+j+len]-=MOD;
					if(a[i+j+len]<0) a[i+j+len]+=MOD;
					pw=1ll*pw*w%MOD;
				}
			}
		}
		if(iv==-1)
		{
			for(int i=0;i<=lim;i++)
			{
				a[i]=1ll*a[i]*in%MOD;
			}
		}
	}
	inline poly operator *(poly a,poly b)
	{
		int n=a.size(),m=b.size(),lim=1;
		while(lim<=n+m) lim<<=1;
		a.resize(lim+1);
		b.resize(lim+1);
		std::vector<int> rev(lim+1);
		for(int i=1;i<=lim;i++)
		{
			rev[i]=rev[i>>1]>>1|((i&1)?(lim>>1):0);
		}
		ntt(a,rev,lim,1);
		ntt(b,rev,lim,1);
		for(int i=0;i<=lim;i++) a[i]=1ll*a[i]*b[i]%MOD;
		ntt(a,rev,lim,-1);
		a.resize(n+m-1);
		return a;
	}
	inline poly &operator *=(poly &a,const poly &b){return a=a*b;}
	inline poly operator *(poly a,int b)
	{
		for(auto &i:a) i=1ll*i*b%MOD;
		return a;
	}
	inline poly operator *(int a,poly b)
	{
		return b*a;
	}
	inline poly &operator *=(poly &a,int b){return a=a*b;}
	inline poly Inv(poly a,int b=-1)	
	{
		if(b==-1) b=a.size();
		if(b==1) return poly({qpow(a[0],MOD-2)});
		poly f0=Inv(a,(b+1)>>1);
		poly c=a;
		c.resize(b+1);
		int lim=1;
		while(lim<=b*2) lim<<=1;
		std::vector<int> rev(lim+1);
		c.resize(lim+1);
		f0.resize(lim+1);
		for(int i=1;i<=lim;i++)
		{
			rev[i]=rev[i>>1]>>1|((i&1)?(lim>>1):0);
		}
		ntt(c,rev,lim,1);
		ntt(f0,rev,lim,1);
		for(int i=0;i<=lim;i++) c[i]=((f0[i]*2%MOD-1ll*c[i]*f0[i]%MOD*f0[i]%MOD)%MOD+MOD)%MOD;
		ntt(c,rev,lim,-1);
		c.resize(b);
		return c;
	}
	inline poly Sqrt(poly a,int b=-1)
	{
		if(b==-1) b=a.size();
		if(b==1) return poly({1});
		poly c=a;
		c.resize(b);
		poly f0=Sqrt(a,(b+1)>>1);
		poly g=Inv(f0,b);
		poly res=(c+f0*f0)*g*I2;
		res.resize(b);
		return res;
	}
	inline poly Dt(poly a)
	{
		for(int i=0;i<(int)a.size();i++)
		{
			a[i]=1ll*(i+1)*a[i+1]%MOD;
		}
		a.pop_back();
		return a;
	}
	inline poly Int(poly a)
	{
		a.emplace_back();
		for(int i=(int)a.size()-2;i>=0;i--)
		{
			a[i+1]=1ll*a[i]*qpow(i+1,MOD-2)%MOD;
		}
		a[0]=0;
		return a;
	}
	inline poly Ln(poly a)
	{
		poly res=Int(Dt(a)*Inv(a));
		res.resize((int)a.size());
		return res;
	}
	inline poly Exp(poly a,int b=-1)
	{
		if(b==-1) b=a.size();
		if(b==1) return poly({1});
		poly c=a;
		c.resize(b);
		poly f0=Exp(a,(b+1)>>1);
		poly res=(c-Ln(f0)+1)*f0;
		if(b!=(int)a.size()) res.resize(b<<1);
		else res.resize(b);
		return res;
	}
	inline poly Qpow_E(poly a,int b)
	{
		return Exp(Ln(a)*b);
	}
	inline poly Sub_mul(poly a,poly b)
	{
		poly f(a.size());
		std::reverse(b.begin(),b.end());
		f=a*b;
		for(int i=0;i<(int)a.size();i++)
		{
			f[i]=f[i+(int)b.size()-1];
		}
		f.resize(a.size());
		return f;
	}
}
using namespace polynomial;
const int mod=998244353;
int n,a[1000005],f[1000005],ad=(1<<29)-1,Or;
int fac[1000005],inv[1000005];
poly g,h;
int C(int n,int m)
{
	return 1ll*fac[n]*inv[m]%mod*inv[n-m]%mod;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		ad&=a[i];
		Or|=a[i];
		f[a[i]]++;
	}
	fac[0]=inv[0]=1;
	for(int i=1;i<=n;i++)
	{
		fac[i]=1ll*fac[i-1]*i%mod;
		inv[i]=qpow(fac[i],mod-2)%mod;
	}
	if(ad!=0)
	{
		for(int i=1;i<=n;i++)
		{
			cout<<0<<" ";
		}
		return 0;
	}
	for(int i=0;i<19;i++)
	{
		for(int j=0;j<(1<<19);j++)
		{
			if(!(j>>i&1)) f[j]+=f[j^(1<<i)];
		}
	}
	g.resize(n+1),h.resize(n+1);
	for(int i=0;i<(1<<19);i++)
	{
		if((Or&i)!=i) continue ;
		int ni=i;
		if(__builtin_parity(i)) g[n-f[ni]]--;
		else g[n-f[ni]]++;
	}
	for(int i=0;i<=n;i++)
	{
		if(g[i]<0) g[i]+=mod;
		g[i]=1ll*g[i]*fac[n-i]%mod;
		h[i]=inv[i];
	}
	h=h*g;
	for(int i=0;i<=n;i++)
	{
		h[i]=1ll*h[i]*inv[n-i]%mod;
	}
	// for(int i=0;i<=n;i++)
	// {
	// 	for(int j=0;j<=i;j++)
	// 	{
	// 		h[i]+=1ll*g[j]*C(n-j,i-j)%mod;
	// 		if(h[i]>=mod) h[i]-=mod;
	// 	}
	// }

	for(int i=n-1;i>=0;i--) cout<<h[i]<<" ";
}