using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var n = NN;
        var map = NArr(n);
        var max = 0;
        foreach (var elem in map) for (var i = 1; i < elem.Length; ++i) max = Math.Max(max, elem[i]);
        var bitmax = 1 << max;
        var count = new int[bitmax];
        for (var i = 0; i < n; ++i)
        {
            var key = 0;
            for (var j = 1; j < map[i].Length; ++j) key += 1 << map[i][j] - 1;
            ++count[key];
        }
        var dp = new long[bitmax];
        var mod = 998_244_353;
        for (var i = 0; i < bitmax; ++i)
        {
            if (count[i] == 0) continue;
            var mul = 1L;
            for (var j = 0; j < count[i]; ++j) mul = mul * 2 % mod;
            mul = (mod + mul - 1) % mod;
            var ndp = (long[]) dp.Clone();
            ndp[i] = (ndp[i] + mul) % mod;
            for (var j = 0; j < bitmax; ++j) ndp[i & j] = (ndp[i & j] + dp[j] * mul) % mod;
            dp = ndp;
        }
        WriteLine(dp[0]);
    }
}