MOD = 998244353
N = int(input())
A = []
for _ in range(N):
    a = list(map(int,input().split()))
    A.append(set(a[1:]))
M = 0
for i in range(N):
    a = 0
    if len(A[i])==0:
        a = 0
    else:
        a = max(A[i])
    M = max(M,a)
I = [set() for _ in range(M+1)]
for j in range(1,M+1):
    for i in range(N):
        if j in A[i]:
            I[j].add(i)
ans = 0
for k in range(1,1<<M):
    J = set(list(range(N)))
    cnt = 0
    for j in range(M):
        if (k>>j)&1:
            J &= I[j+1]
            cnt += 1
    if cnt%2==0:
        ans = (ans-pow(2,len(J),MOD)+1)%MOD
    else:
        ans = (ans+pow(2,len(J),MOD)-1)%MOD
ans = (pow(2,N,MOD)-1-ans)%MOD
print(ans)