#include<bits/stdc++.h>
#include<bit>
#include<random>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
//#define vec vector<ll>
//#define mat vector<vector<ll> >
#define fi first
#define se second
#define double long double
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
//typedef long double ld;
typedef complex<double> Complex;
const ll INF=1e9+7;
const ll MOD=998244353;
const ll inf=INF*INF;
const ll mod=MOD;
const ll MAX=2000010;
const double PI=acos(-1.0);
typedef vector<vector<ll> > mat;
typedef vector<ll> vec;



void solve(){
    ll n;cin>>n;
    vector<ll>c(n);
    rep(i,n){
        ll k;cin>>k;
        rep(j,k){
            ll z;cin>>z;
            z--;
            c[i]+=(1<<z);
        }
        //cout<<c[i]<<endl;
    }
    vector<vector<ll> > dp(n+1,vector<ll>(1<<12));
    rep(i,n)dp[i+1][c[i]]=1;
    rep(i,n){
        rep(j,1<<12){
            dp[i+1][j]=(dp[i+1][j]+dp[i][j])%mod;
            dp[i+1][j&c[i]]=(dp[i+1][j&c[i]]+dp[i][j])%mod;
        }
    }
    ll ans=dp[n][0];
    if(ans<0)ans+=mod;
    cout<<ans<<endl;
}

signed main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
}