#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)
// Ref: https://qiita.com/ysuzuki19/items/d89057d65284ba1a16ac
#define dump(var)  do{std::cerr << #var << " : ";view(var);}while(0)
template<typename T> void view(T e){std::cerr << e << "\n";}
template<typename T> void view(const std::vector<T>& v){for(const auto& e : v){ std::cerr << e << " "; } std::cerr << "\n";}
template<typename T> void view(const std::vector<std::vector<T> >& vv){ std::cerr << "\n"; for(const auto& v : vv){ view(v); } }
template<typename T> void dump_cout(const T& v) { for(long long i = 0; i < v.size(); i++) std::cout << v[i] << (i == v.size()-1 ? "\n" : " "); }

#include <atcoder/modint>
using namespace atcoder;
using mint = modint998244353;

void solve() {
    ll n;
    cin >> n;
    vector<int> mask(n, 0);
    rep(i, 0, n) {
        ll k;
        cin >> k;
        rep(j, 0, k) {
            ll c;
            cin >> c;
            mask[i] |= (1<<(c-1));
        }
    }
    vector dp(n+1, vector<mint>(1<<12, 0));
    dp[0][(1<<12)-1] = 1;
    rep(i, 0, n) {
        rep(bit, 0, 1<<12) {
            dp[i+1][bit] += dp[i][bit];
            dp[i+1][bit & mask[i]] += dp[i][bit];
        }
    }
    cout << dp[n][0].val() << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}