N = int(input())

num = [0]*(1<<12)
for i in range(N):
    K,*C = map(int, input().split())
    for j in range(1,1<<K):
        nn = 0
        for k in range(K):
            if j&(1<<k):
                nn ^= (1<<(C[k]-1))
        num[nn] += 1

mod = 998244353
dp = [0]*(1<<12)
for i in range((1<<12)-1,0,-1):
    dp[i] = (pow(2,num[i],mod)-1)%mod
    no = []
    for j in range(12):
        if not i&(1<<j):
            no.append(j)
    for k in range(1,1<<(len(no))):
        bit = i
        for l in range(len(no)):
            if k&(1<<l):
                bit ^= 1<<no[l]
        dp[i] -= dp[bit]
        dp[i] %= mod
res = (pow(2,N,mod)-1)%mod
for i in range(1<<12):
    res -= dp[i]
    res %= mod
print(res)