#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=1e5+5,M=26*26*26*26*26+5,K=2e7+5,mod=998244353,Mod=mod-1;const db eps=1e-6;const ll INF=1e18+7;mt19937 rnd(263082);
int n;ll f[N],g[N],frc[N],inv[N];
char s[N][6],t[N][6];
int S[M];
void dfs(int x,int y,int z,int w,int Id){
	if(z==5) {S[Id]+=w;return;}
	int l,r;
	if(t[y][z]=='=') l=r=s[y][z];
	else if(t[y][z]=='>') l=s[y][z]+1,r=25;
	else l=0,r=s[y][z]-1;
	if(x>>z&1) r--;
	if(l<=r) {
		dfs(x,y,z+1,w,Id*26+l);
		if(r^25) dfs(x,y,z+1,-w,Id*26+r+1);
	}
}
void Solve(){
	int i,j,h;scanf("%d",&n);
	for(i=1;i<=n;i++) for(scanf("%s%s",s[i],t[i]),j=0;j<5;j++) s[i][j]-='A';
	for(i=0;i<32;i++){
		Me(S,0);
		for(j=1;j<=n;j++) dfs(i,j,0,1,0);
		for(j=1;j<M-5;j*=26) for(h=0;h<M-5;h++) if(h/j%26) S[h]+=S[h-j];
		int op=(__builtin_parity(i)?-1:1);for(j=0;j<M;j++) f[S[j]]+=op;
		// cerr<<i<<'\n';
		// for(j=1;j<=n;j++) cerr<<f[j]<<' ';cerr<<'\n';
	}
	inv[1]=1;for(i=2;i<=n;i++) inv[i]=(mod-inv[mod%i])*(mod/i)%mod;
	for(frc[0]=inv[0]=i=1;i<=n;i++) frc[i]=frc[i-1]*i%mod,inv[i]=inv[i-1]*inv[i]%mod;
	for(i=1;i<=n;i++) f[i]=f[i]*frc[i]%mod;
	for(i=1;i<=n;i++){
		for(j=i;j<=n;j++) g[i]+=f[j]*inv[j-i]%mod;
		g[i]=(g[i]%mod+mod)%mod;
		// cerr<<g[i]<<' ';
	}//cerr<<'\n';
	g[0]=1;for(i=1;i<=n;i++) printf("%lld ",(g[i-1]*(n-i+1)%mod-g[i]+mod)%mod);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}