#!/usr/bin/env python3
# from typing import *

import sys
import io
import math
import collections
import decimal
import itertools
import bisect
import heapq


def input():
    return sys.stdin.readline()[:-1]


# sys.setrecursionlimit(1000000)

# _INPUT = """3
# 2 1 2
# 2 1 3 
# 2 2 3

# """
# sys.stdin = io.StringIO(_INPUT)

INF = 10**10

MOD = 998244353

N = int(input())
S = []
for _ in range(N):
    dat = list(map(int, input().split()))
    s = 0
    for c in dat[1:]:
        s |= (1<<(c-1))
    S.append(s)

n = 0
for mask in range(1, 1<<12):
    k = bin(mask).count("1") 
    v = len([s for s in S if (mask & s == mask)])
    n += ((-1)**(k-1) * (pow(2, v, MOD) - 1)) % MOD

ans = (pow(2, N, MOD) - 1 - n) % MOD
print(ans)