#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
//const bool debug = false;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n; cin >> n;
	int lim = 12;
	vector<int>memo(1 << lim);
	rep(i, n) {
		int k; cin >> k;
		int now = 0;
		rep(j, k) {
			int num; cin >> num; num--;
			now += 1 << num;
		}
		memo[now]++;
	}
	vector<vector<mint>> dp((1 << lim) + 1, vector<mint>(1 << lim));
	dp[0][(1 << lim) - 1] = 1;
	rep(i, 1 << lim) {
		rep(j, 1 << lim) {
			dp[i + 1][j] += dp[i][j];
			mint pw = (mint)pow_mod(2, memo[i], mod) - 1;
			int nj = j & i;
			dp[i + 1][nj] += dp[i][j] * pw;
		}
	}
	/*rep(i, (1 << lim) + 1) {
		rep(j, 1 << lim) cout << dp[i][j].val() << " ";
		cout << endl;
	}*/
	cout << dp[1 << lim][0].val() << endl;
	return 0;
}