import copy
N = int(input())
L = []
mod = 998244353
for _ in range(N):
    A = list(map(int, input().split()))
    temp = 0
    for i in range(1,A[0]+1):
        temp+=2**(A[i]-1)
    L.append(temp)
DP = [0]*(max(L)+1)
for l in L:
    NDP = copy.copy(DP)
    for i in range(len(DP)):
        if DP[i]>0:
            NDP[i&l]=(NDP[i&l]+DP[i])%mod
    NDP[l]+=1
    DP = NDP
print(DP[0]%mod)