#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef long long int ll;
typedef long double ld;
#define FOR(i,l,r) for(ll i=l;i<r;i++)
#define REP(i,n) FOR(i,0,n)
#define RFOR(i,l,r) for(ll i=r-1;i>=l;i--)
#define RREP(i,n) RFOR(i,0,n)
#define ALL(x) x.begin(),x.end()
#define P pair<ll,ll>
#define F first
#define S second
#define BS(A,x) binary_search(ALL(A),x)
#define LB(A,x) (ll)(lower_bound(ALL(A),x)-A.begin())
#define UB(A,x) (ll)(upper_bound(ALL(A),x)-A.begin())
#define COU(A,x) UB(A,x)-LB(A,x)
template<typename T>using min_priority_queue=priority_queue<T,vector<T>,greater<T>>;
using mint1=modint1000000007;
using mint2=modint998244353;
signed main(){
  ll N;cin>>N;vector<vector<bool>>C(N,vector<bool>(12,0));
  vector<bool>A(12,0);mint2 ans=0;
  REP(i,N){ll k;cin>>k;REP(j,k){ll c;cin>>c;C[i][c-1]=1;}}
  REP(s,4096){
    ll k=s,t=0;REP(i,12){A[i]=k%2;k/=2;}
    REP(i,N){bool x=1;REP(j,12)if(A[j]&&!C[i][j])x=0;if(x)t++;}
    k=0;REP(i,12)if(A[i])k++;if(k%2)k=-1;else k=1;
    ans+=pow_mod(2,t,998244353)*k;
  }
  cout<<ans.val()<<endl;
  return 0;
}