#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=1167167167167167167;
const int INF=2100000000;
ll mod=998244353;
#define rep(i,a) for (int i=0;i<a;i++)
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}



//  rainy ~ 雨に打たれて ~
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int n,m=12;
	cin>>n;
	vector<vector<bool>> p(n,vector<bool>(m));
	rep(i,n){
		int k;
		cin>>k;
		rep(j,k){
			int a;
			cin>>a;
			p[i][a]=1;
		}
	}
	vector<ll> my_pow(n+1,1);
	rep(i,n) my_pow[i+1]=(my_pow[i]*2ll)%mod;
	ll ans=0;
	rep(i,(1<<m)){
		int tmp=0;
		rep(j,n){
			int ok=1;
			rep(k,m){
				if(!p[j][k]&&(i&(1<<k))) ok=0;
			}
			tmp+=ok;
		}
		int b=1;
		rep(k,m) if(i&(1<<k)) b*=-1;
		ans+=b*my_pow[tmp];
		ans%=mod;
	}
	cout<<(ans+mod)%mod<<"\n";
}