#include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <set>
#include <iomanip>
#include <queue>
#include <algorithm>
#include <numeric>
#include <deque>
#include <complex>
#include <cassert>

using namespace std;

const long long modc=998244353;

int main(){

    long long N, M, s, k, C, ans=0;
    M = 1LL<<12;
    cin >> N;
    vector<long long> S(N+1);
    for (int i=1; i<=N; i++){
        cin >> k;
        s = 0;
        for (int j=0; j<k; j++){
            cin >> C;
            s += 1LL<<C;
        }
        S[i] = s;
    }


    vector<vector<long long>> dp(N+1, vector<long long>(M));
    for (int i=1; i<=N; i++){
        dp[i][S[i]]++;
    }

    for (int i=1; i<=N; i++){
        for (int j=0; j<M; j++){
            dp[i][j] += dp[i-1][j];
            dp[i][j] %= modc;
            dp[i][j&S[i]] += dp[i-1][j];
            dp[i][j&S[i]] %= modc;
        }
    }

    cout << dp[N][0] << endl;

    return 0;
}