#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
using ll = long long;
using mint = modint998244353;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vmi = vector<mint>;
using vvmi = vector<vmi>;
using vvvmi = vector<vvmi>;
#define all(a) (a).begin(), (a).end()
#define rep2(i, m, n) for (int i = (m); i < (n); ++i)
#define rep(i, n) rep2(i, 0, n)
#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)
#define drep(i, n) drep2(i, n, 0)

void solve(){
    
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    int n; cin >> n;
    vector<bitset<12>> vb(n);
    rep(i, n){
        int k; cin >> k;
        bitset<12> bs(0);
        rep(j, k){
            int c; cin >> c;
            bs.set(c-1);
        }
        vb[i] = bs;
    }
    mint ans = mint(2).pow(n) - 1;
    rep2(i, 1, 1<<12){
        bitset<12> bs(i);
        int tmp = 0;
        rep(j, n){
            tmp += ((bs & vb[j]) == bs); 
        }
        mint tmp2 = mint(2).pow(tmp) - 1;
        ans += tmp2 * mint(-1).pow(bs.count());
    }cout << ans.val() << endl;
    return 0;
}