#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <iomanip>
#include <cmath>
#include <stdio.h>
#include <queue>
#include <deque>
#include <cstdio>
#include <set>
#include <map>
#include <bitset>
#include <stack>
#include <cctype>
using namespace std;
long long mod = 998244353;
long long dp[550][4100] = {};
int c[15];
int main() {
	int n;
	cin >> n;
	dp[0][0] = 1;
	for (int i = 1; i <= n; i++) {
		int k;
		cin >> k;
		int a = (1 << 12) - 1;
		for (int j = 0; j < k; j++) {
			cin >> c[j];
			a -= (1 << (c[j] - 1));
		}
		for (int j = 0; j < (1 << 12); j++) {
			dp[i][j] += dp[i - 1][j];
			dp[i][j] %= mod;
			dp[i][a | j] += dp[i - 1][j];
			dp[i][a | j] %= mod;
		}
	}
	cout << dp[n][(1 << 12) - 1] << endl;
}