#include <bits/stdc++.h>


#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define rep(i, n) for(int i = 0; i < (n); i += 1)
#define rep1(i, n) for(int i = 1; i < (n); i += 1)


using namespace std;

const ll inf = 1e18;
mt19937 rnd(234);


namespace fft {

    typedef double dbl;

    struct num {
        dbl x, y;
        num() { x = y = 0; }
        num(dbl x_, dbl y_) : x(x_), y(y_) {}
    };

    inline num operator+(num a, num b) { return num(a.x + b.x, a.y + b.y); }
    inline num operator-(num a, num b) { return num(a.x - b.x, a.y - b.y); }
    inline num operator*(num a, num b) { return num(a.x * b.x - a.y * b.y, a.x * b.y + a.y * b.x); }
    inline num conj(num a) { return num(a.x, -a.y); }

    int base = 1;
    vector<num> roots = { {0, 0}, {1, 0} };
    vector<int> rev = { 0, 1 };

    const dbl PI = static_cast<dbl>(acosl(-1.0));

    void ensure_base(int nbase) {
        if (nbase <= base) {
            return;
        }
        rev.resize(1 << nbase);
        for (int i = 0; i < (1 << nbase); i++) {
            rev[i] = (rev[i >> 1] >> 1) + ((i & 1) << (nbase - 1));
        }
        roots.resize(1 << nbase);
        while (base < nbase) {
            dbl angle = 2 * PI / (1 << (base + 1));
            //      num z(cos(angle), sin(angle));
            for (int i = 1 << (base - 1); i < (1 << base); i++) {
                roots[i << 1] = roots[i];
                //        roots[(i << 1) + 1] = roots[i] * z;
                dbl angle_i = angle * (2 * i + 1 - (1 << base));
                roots[(i << 1) + 1] = num(cos(angle_i), sin(angle_i));
            }
            base++;
        }
    }

    void fft(vector<num>& a, int n = -1) {
        if (n == -1) {
            n = (int)a.size();
        }
        assert((n & (n - 1)) == 0);
        int zeros = __builtin_ctz(n);
        ensure_base(zeros);
        int shift = base - zeros;
        for (int i = 0; i < n; i++) {
            if (i < (rev[i] >> shift)) {
                swap(a[i], a[rev[i] >> shift]);
            }
        }
        for (int k = 1; k < n; k <<= 1) {
            for (int i = 0; i < n; i += 2 * k) {
                for (int j = 0; j < k; j++) {
                    num z = a[i + j + k] * roots[j + k];
                    a[i + j + k] = a[i + j] - z;
                    a[i + j] = a[i + j] + z;
                }
            }
        }
    }

    vector<num> fa, fb;

    vector<int64_t> square(const vector<int>& a) {
        if (a.empty()) {
            return {};
        }
        int need = (int)a.size() + (int)a.size() - 1;
        int nbase = 1;
        while ((1 << nbase) < need) nbase++;
        ensure_base(nbase);
        int sz = 1 << nbase;
        if ((sz >> 1) > (int)fa.size()) {
            fa.resize(sz >> 1);
        }
        for (int i = 0; i < (sz >> 1); i++) {
            int x = (2 * i < (int)a.size() ? a[2 * i] : 0);
            int y = (2 * i + 1 < (int)a.size() ? a[2 * i + 1] : 0);
            fa[i] = num(x, y);
        }
        fft(fa, sz >> 1);
        num r(1.0 / (sz >> 1), 0.0);
        for (int i = 0; i <= (sz >> 2); i++) {
            int j = ((sz >> 1) - i) & ((sz >> 1) - 1);
            num fe = (fa[i] + conj(fa[j])) * num(0.5, 0);
            num fo = (fa[i] - conj(fa[j])) * num(0, -0.5);
            num aux = fe * fe + fo * fo * roots[(sz >> 1) + i] * roots[(sz >> 1) + i];
            num tmp = fe * fo;
            fa[i] = r * (conj(aux) + num(0, 2) * conj(tmp));
            fa[j] = r * (aux + num(0, 2) * tmp);
        }
        fft(fa, sz >> 1);
        vector<int64_t> res(need);
        for (int i = 0; i < need; i++) {
            res[i] = llround(i % 2 == 0 ? fa[i >> 1].x : fa[i >> 1].y);
        }
        return res;
    }

    vector<int64_t> multiply(const vector<int>& a, const vector<int>& b) {
        if (a.empty() || b.empty()) {
            return {};
        }
        if (a == b) {
            return square(a);
        }
        int need = (int)a.size() + (int)b.size() - 1;
        int nbase = 1;
        while ((1 << nbase) < need) nbase++;
        ensure_base(nbase);
        int sz = 1 << nbase;
        if (sz > (int)fa.size()) {
            fa.resize(sz);
        }
        for (int i = 0; i < sz; i++) {
            int x = (i < (int)a.size() ? a[i] : 0);
            int y = (i < (int)b.size() ? b[i] : 0);
            fa[i] = num(x, y);
        }
        fft(fa, sz);
        num r(0, -0.25 / (sz >> 1));
        for (int i = 0; i <= (sz >> 1); i++) {
            int j = (sz - i) & (sz - 1);
            num z = (fa[j] * fa[j] - conj(fa[i] * fa[i])) * r;
            fa[j] = (fa[i] * fa[i] - conj(fa[j] * fa[j])) * r;
            fa[i] = z;
        }
        for (int i = 0; i < (sz >> 1); i++) {
            num A0 = (fa[i] + fa[i + (sz >> 1)]) * num(0.5, 0);
            num A1 = (fa[i] - fa[i + (sz >> 1)]) * num(0.5, 0) * roots[(sz >> 1) + i];
            fa[i] = A0 + A1 * num(0, 1);
        }
        fft(fa, sz >> 1);
        vector<int64_t> res(need);
        for (int i = 0; i < need; i++) {
            res[i] = llround(i % 2 == 0 ? fa[i >> 1].x : fa[i >> 1].y);
        }
        return res;
    }

    vector<int> multiply_mod(const vector<int>& a, const vector<int>& b, int m) {
        if (a.empty() || b.empty()) {
            return {};
        }
        int eq = (a.size() == b.size() && a == b);
        int need = (int)a.size() + (int)b.size() - 1;
        int nbase = 0;
        while ((1 << nbase) < need) nbase++;
        ensure_base(nbase);
        int sz = 1 << nbase;
        if (sz > (int)fa.size()) {
            fa.resize(sz);
        }
        for (int i = 0; i < (int)a.size(); i++) {
            int x = (a[i] % m + m) % m;
            fa[i] = num(x & ((1 << 15) - 1), x >> 15);
        }
        fill(fa.begin() + a.size(), fa.begin() + sz, num{ 0, 0 });
        fft(fa, sz);
        if (sz > (int) fb.size()) {
            fb.resize(sz);
        }
        if (eq) {
            copy(fa.begin(), fa.begin() + sz, fb.begin());
        } else {
            for (int i = 0; i < (int)b.size(); i++) {
                int x = (b[i] % m + m) % m;
                fb[i] = num(x & ((1 << 15) - 1), x >> 15);
            }
            fill(fb.begin() + b.size(), fb.begin() + sz, num{ 0, 0 });
            fft(fb, sz);
        }
        dbl ratio = 0.25 / sz;
        num r2(0, -1);
        num r3(ratio, 0);
        num r4(0, -ratio);
        num r5(0, 1);
        for (int i = 0; i <= (sz >> 1); i++) {
            int j = (sz - i) & (sz - 1);
            num a1 = (fa[i] + conj(fa[j]));
            num a2 = (fa[i] - conj(fa[j])) * r2;
            num b1 = (fb[i] + conj(fb[j])) * r3;
            num b2 = (fb[i] - conj(fb[j])) * r4;
            if (i != j) {
                num c1 = (fa[j] + conj(fa[i]));
                num c2 = (fa[j] - conj(fa[i])) * r2;
                num d1 = (fb[j] + conj(fb[i])) * r3;
                num d2 = (fb[j] - conj(fb[i])) * r4;
                fa[i] = c1 * d1 + c2 * d2 * r5;
                fb[i] = c1 * d2 + c2 * d1;
            }
            fa[j] = a1 * b1 + a2 * b2 * r5;
            fb[j] = a1 * b2 + a2 * b1;
        }
        fft(fa, sz);
        fft(fb, sz);
        vector<int> res(need);
        for (int i = 0; i < need; i++) {
            int64_t aa = llround(fa[i].x);
            int64_t bb = llround(fb[i].x);
            int64_t cc = llround(fa[i].y);
            res[i] = static_cast<int>((aa + ((bb % m) << 15) + ((cc % m) << 30)) % m);
        }
        return res;
    }

}  // namespace fft


const ll mod = 998244353;


ll bin_pow(ll x, ll n) {
    if (n == 0) {
        return 1;
    }
    ll a = bin_pow(x, n / 2);
    a = (a * a) % mod;
    if (n & 1) {
        a = (a * x) % mod;
    }
    return a;
}


ll rev(ll x) {
    return bin_pow(x, mod - 2);
}


int n;
vector<string> a, resp;
int cnt[27][27][27][27][27];

int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    cin >> n;
    a.resize(n);
    resp.resize(n);
    for (int i = 0; i < n; i += 1) {
        cin >> a[i] >> resp[i];
    }
    vector<ll> sets(n + 1);
    rep(mask, 32) {
        memset(cnt, 0, sizeof(cnt));
        auto get_lr = [&](int i, int j) {
            int l = a[i][j] - 'A';
            int r = l;
            if (resp[i][j] == '>') {
                l += 1;
                r = 25;
            } else if (resp[i][j] == '<') {
                l = 0;
                r -= 1;
            }
            if ((mask >> j) & 1) {
                r -= 1;
            }
            if (l > r) {
                l = 1;
                r = 0;
            }
            return make_pair(l, r);
            };
        rep(i, n) {
            auto [l0, r0] = get_lr(i, 0);
            auto [l1, r1] = get_lr(i, 1);
            auto [l2, r2] = get_lr(i, 2);
            auto [l3, r3] = get_lr(i, 3);
            auto [l4, r4] = get_lr(i, 4);
            rep(x0, 2) rep(x1, 2) rep(x2, 2) rep(x3, 2) rep(x4, 2) {
                auto t0 = vector<int>{ l0, r0 + 1 } [x0] ;
                auto t1 = vector<int>{ l1, r1 + 1 } [x1] ;
                auto t2 = vector<int>{ l2, r2 + 1 } [x2] ;
                auto t3 = vector<int>{ l3, r3 + 1 } [x3] ;
                auto t4 = vector<int>{ l4, r4 + 1 } [x4] ;
                if ((x0 + x1 + x2 + x3 + x4) % 2 == 0) {
                    cnt[t0][t1][t2][t3][t4] += 1;
                } else {
                    cnt[t0][t1][t2][t3][t4] -= 1;
                }
            }
        }
        rep1(x0, 27) rep(x1, 27) rep(x2, 27) rep(x3, 27) rep(x4, 27) {
            cnt[x0][x1][x2][x3][x4] += (cnt[x0 - 1][x1][x2][x3][x4]);
        }
        rep(x0, 27) rep1(x1, 27) rep(x2, 27) rep(x3, 27) rep(x4, 27) {
            cnt[x0][x1][x2][x3][x4] += (cnt[x0][x1 - 1][x2][x3][x4]);
        }
        rep(x0, 27) rep(x1, 27) rep1(x2, 27) rep(x3, 27) rep(x4, 27) {
            cnt[x0][x1][x2][x3][x4] += (cnt[x0][x1][x2 - 1][x3][x4]);
        }
        rep(x0, 27) rep(x1, 27) rep(x2, 27) rep1(x3, 27) rep(x4, 27) {
            cnt[x0][x1][x2][x3][x4] += (cnt[x0][x1][x2][x3 - 1][x4]);
        }
        rep(x0, 27) rep(x1, 27) rep(x2, 27) rep(x3, 27) rep1(x4, 27) {
            cnt[x0][x1][x2][x3][x4] += (cnt[x0][x1][x2][x3][x4 - 1]);
        }
        int bits = ((mask >> 0) % 2 + (mask >> 1) % 2 + (mask >> 2) % 2 + (mask >> 3) % 2 + (mask >> 4) % 2);
        if (bits % 2 == 0) {
            rep(x0, 27) rep(x1, 27) rep(x2, 27) rep(x3, 27) rep(x4, 27) {
                int val = cnt[x0][x1][x2][x3][x4];
                assert(0 <= val and val <= n);
                sets[val] += 1;
            }
        } else {
            rep(x0, 27) rep(x1, 27) rep(x2, 27) rep(x3, 27) rep(x4, 27) {
                int val = cnt[x0][x1][x2][x3][x4];
                assert(0 <= val and val <= n);
                sets[val] -= 1;
            }
        }
    }
    vector<ll> f(n + 1);
    f[0] = 1;
    for (int i = 1; i <= n; i += 1) {
        f[i] = (f[i - 1] * i) % mod;
    }
    vector<int> aboba(n + 1);
    for(int i = 0; i <= n; i += 1){
        aboba[i] = rev(f[i]);
    }
    reverse(all(aboba));
    vector<int> abiba(n + 1);
    for(int x = 0; x <= n; x += 1){
        abiba[x] = (sets[x] + mod) * f[x] % mod;
    }
    auto abobebra = fft::multiply_mod(aboba, abiba, mod);
    vector<ll> good_count(n + 1);
    for (int x = 0; x <= n; x += 1) {
        good_count[x] = abobebra[n + x];
    }
    good_count[0] = 1;
    for (int i = 0; i < n; i += 1) {
        ll left = good_count[i] * (n - i) % mod;
        ll right = good_count[i + 1];
        ll value = (left + mod - right) % mod;
        cout << value << " ";
    }
    cout << "\n";
    return 0;
}