#pragma GCC optimize("Ofast")
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
#include <deque>
#include <stack>
#include <sstream>
#include <utility>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <tuple>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}

constexpr ll mod = 998244353;

ll mod_pow(ll a,ll b){
    a%=mod;
    if(b==0)return 1;
    if(b==1)return a;
    ll res=mod_pow(a,b/2)%mod;
    res*=res; res%=mod;
    if(b%2)res*=a;
    return res%mod;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    int K = (1<<12);
    vector<int> cnt(K);
    for(int i=0;i<n;i++){
        int m; cin >> m;
        int u = 0;
        for(int i=0;i<m;i++){
            int x; cin >> x;
            x--;
            u += (1<<x);
        }
        cnt[u]++;
    }
    ll res = 0;
    for(int i=1;i<K;i++){
        int ua = 0;
        for(int j=1;j<K;j++){
            if((i&j) == i){
                ua += cnt[j];
            }
        }
        if(__builtin_popcount(i)%2==1){
            res += mod_pow(2,ua)-1;
        }
        else{
            res -= mod_pow(2,ua)-1;
        }
        res %= mod;
    }
    res = mod_pow(2,n)-1-res;
    res %= mod;
    if(res<0) res += mod;
    cout << res << endl;
}