n = int(input())
mod = 998244353
dp = [0]*(1<<12)
for i in range(n):
    L = list(map(int,input().split()))
    count = 0
    for c in L[1:]:
        count |= 1<<(c-1)
    for j in range(1<<12):
        dp[j&count] += dp[j]
        dp[j&count] %= mod
    dp[count] += 1
ans = pow(2,n,mod)-1
for i in range(1,1<<12):
    ans -= dp[i]
    ans %= mod
print(ans)