#include<bits/stdc++.h>
using namespace std;
const int N=1e5+5;
const int M=26*26*26*26*26;
const int mod=998244353;

int pw[]={1,26,26*26,26*26*26,26*26*26*26,26*26*26*26*26};
int l[N][5],r[N][5],g[N],f[M],fac[N],ifac[N];
string a,b;
int n,msk;

int ksm(int a,int b){
    int res=1;
    while(b>0){
        if(b&1)res=1ll*res*a%mod;
        a=1ll*a*a%mod,b>>=1;
    }
    return res;
}

void dfs(int i,int j,int x,int c){
    if(j==5)return f[x]+=c,void();
    int t=msk>>j&1;
    if(r[i][j]-l[i][j]>t){
        dfs(i,j+1,x+l[i][j]*pw[j],c);
        if(r[i][j]-t<26)
            dfs(i,j+1,x+(r[i][j]-t)*pw[j],-c);
    }
}

void inc(int &a,int b){a=a>=mod-b?a-mod+b:a+b;}

signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);

    cin>>n;
    for(int i=0;i<n;++i){
        cin>>a>>b;
        for(int j=0;j<5;++j)
            if(b[j]=='=') l[i][j]=a[j]-'A',r[i][j]=l[i][j]+1;
            else if(b[j]=='<') r[i][j]=a[j]-'A';
            else l[i][j]=a[j]-'A'+1,r[i][j]=26;
    }

    for(msk=0;msk<(1<<5);++msk){
        memset(f,0,sizeof(f));
        for(int i=0;i<n;++i)dfs(i,0,0,1);
        for(int i=1;i<M;i*=26)
            for(int j=0;j<M;++j)
                if(j/i%26>0)f[j]+=f[j-i];

        int c=__builtin_parity(msk)?-1:1;
        for(int i=0;i<M;++i)inc(g[f[i]],c);
    }

    for(int i=fac[0]=1;i<=n;++i)fac[i]=1ll*fac[i-1]*i%mod;
    ifac[n]=ksm(fac[n],mod-2);
    for(int i=n-1;i>=0;--i)ifac[i]=1ll*ifac[i+1]*(i+1)%mod;

    for(int i=1;i<=n;++i)g[i]=1ll*g[i]*fac[i]%mod;
    for(int i=1;i<=n;++i)for(int j=1;j<i;++j)
        (g[j]+=1ll*g[i]*ifac[i-j]%mod)%=mod;

    g[0]=1;
    for(int i=1;i<=n;++i)
        cout<<((1ll*g[i-1]*(n-i+1)%mod-g[i])%mod+mod)%mod<<' ';
    
    return 0;
}