N = int(input())

dat = [0] * (1 << 12)
for _ in range(N):
    k,*l = map(int,input().split())
    bit = 0
    for i in l:
        bit |= 1 << (i-1)
    dat[bit] += 1
P = 998244353
for i in range(12):
    for bit in range(1 << 12):
        if bit & (1 << i):
            dat[bit ^ (1 << i)] += dat[bit]
ans = pow(2,N,P)-1
for bit in range(1,1 << 12):
    if bin(bit).count('1') % 2 == 0:
        c = 1
    else:
        c = -1
    tmp = pow(2,dat[bit],P) - 1
    ans = (ans + c * tmp) % P
print(ans)