n = int(input())
mod = 998244353

state = [set() for _ in range(12)]
for i in range(n):
    L = list(map(int, input().split()))
    k = L[0]
    L = L[1:]
    for j in range(k):
        state[L[j] - 1].add(i)

ans = 0
for bit in range(1 << 12):
    curr_state = set(range(n))
    bit_cnt = 0
    for i in range(12):
        if 1 & (bit >> i):
            curr_state &= state[i]
            bit_cnt += 1
    ans += pow(2, len(curr_state), mod) * pow(-1, bit_cnt)
    ans %= mod
print(ans)