#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
typedef int64_t lint;
#define rep(i, n) for(int i=0; i<n; i++)
#define repx(i, l, n) for(int i=l; i<n; i++)
#define all(v) v.begin(), v.end()
#define show(x) cout << #x << ": " << x << endl;
#define list(x) cout << #x << ": " << x << "  ";
#define pb push_back
using vi = vector<lint>;
using vvi = vector<vector<lint>>;
template<class T> inline void vin(vector<T>& v) { rep(i, v.size()) cin >> v.at(i); }
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<class T> inline void drop(T x) { cout << x << endl; exit(0); }
template<class T> void vout(vector<T> v) { rep(i, v.size()) { cout << v.at(i) << ' '; } cout << endl; }
constexpr lint LINF = LLONG_MAX/2;
using mint = modint998244353;
using vm = vector<mint>;

int main() {
	lint N;
	cin >> N;
	vi v(N);
	std::vector<set<int>> w(N);

	mint a=2, b=0, c=0;
	lint x, y, z;
	rep(i, N) {
		cin >> v[i];
		rep(j, v[i]) {
			cin >> x;
			x--;
			w[i].insert(x);
		}
	}
	rep(bit, 1<<12) {
		bitset<12> bits = bit;
		x = 0;
		rep(i, N) {
			bool f = true;
			rep(j, 12) {
				if (bits.test(j)) {
					if (!w[i].count(j)) f = false;
				}
			}
			if (f) x++;
		}
		if (bits.count()%2 == 0) b += a.pow(x);
		else b -= a.pow(x);
	}
	std::cout << b.val() << '\n';
}