#include <bits/stdc++.h>
#define rep(i, l, r) for (int i = (l); i < (r); i++)
using namespace std;

typedef long long ll;

int main() {
    int N, C;
    cin >> N;
    vector<int> k(N), b(N, 0);
    rep(i, 0, N) {
        cin >> k[i];
        rep(j, 0, k[i]) {
            cin >> C;
            b[i] += 1 << (C - 1);
        }
        //cout << b[i] << " ";
    }
    //cout << endl;
    ll MOD = 998244353;
    vector<vector<ll>> dp(N + 1, vector<ll>(1 << 12, 0));
    dp[0][(1 << 12) - 1] = 1;
    rep(i, 0, N) {
        rep(j, 0, 1 << 12) {
            dp[i + 1][j] += dp[i][j];
            dp[i + 1][j] %= MOD;
            dp[i + 1][j & b[i]] += dp[i][j];
            dp[i + 1][j & b[i]] %= MOD;
        }
    }
    cout << dp[N][0] << endl;
    /*
    rep(i, 0, N + 1) {
        rep(j, 0, 16) cout << dp[i][j] << " ";
        cout << endl;
    }
    */
}