n=int(input())
cnt=[0]*(2**13)
a=[]
for i in range(n):
  b=list(map(int,input().split()))
  tmp=0
  for j in b[1:]:
    tmp+=2**j
  a.append(tmp)
mod=998244353
ans=0
for bit in range(1,2**13):
  tmp=0
  for i in a:
    if bit&i==bit:
      tmp+=1
  num=pow(2,tmp,mod)-1
  c=0
  for i in range(13):
    if bit&(1<<i)!=0:
      c+=1
  if c%2==0:
    ans-=num
  else:
    ans+=num
print((pow(2,n,mod)-ans-1)%mod)