import sys
sys.setrecursionlimit(1000000)
#input = sys.stdin.buffer.readline
input = sys.stdin.readline
import copy

def main():
    N = int(input()); MOD = 998244353
    A = []
    for i in range(N):
        k,*c = input().split()
        c = [int(cc) - 1 for cc in c] #0-index
        A.append(c)
    #print(A)

    #dp[mask]: 集合がmaskとなるときの場合の数
    MAX = 12
    dp = [0]*(1<<MAX)
    #dp[0] = 1 #空集合は1通り
    for i in range(N):
        p = copy.copy(dp) #i番目を選ばない
        p,dp = dp,p
        imask = 0
        for j in A[i]:
            imask += 1<<j
        #print(imask)
        dp[imask] += 1 #これだけ選ぶ
        for j in range(1<<MAX):
            dp[j&imask] += p[j] #i番目を選んだ時
            dp[j&imask] %= MOD
        #print(dp)
    
    #print(dp)
    ans = dp[0]
    print(ans%MOD)

             

if __name__ == '__main__':
    main()