N=int(input())
C=[0]*N
for n in range(N):
    K,*c=map(int,input().split())
    for k in range(K):
        c[k]-=1
        C[n]|=1<<c[k]
mod=998244353
ans=0
M=12
for bit in range(1<<M):
    cnt=0
    for n in range(N):
        if bit==C[n]&bit:
            cnt+=1
    ans+=pow(2,cnt,mod)*(-1)**sum(1 for m in range(M) if bit&1<<m)
    ans%=mod
print(ans)