#include <bits/stdc++.h>
#include <atcoder/modint>
using namespace std;
using namespace atcoder;
using mint = modint998244353;
//using mint = modint1000000007;
using ll = long long;
using ld = long double;
using pll = pair<ll, ll>;
using tlll = tuple<ll, ll, ll>;
constexpr ll INF = 1LL << 60;
template<class T> bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return false;}
template<class T> bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return false;}
ll safemod(ll A, ll M) {return (A % M + M) % M;}
ll divfloor(ll A, ll B) {if (B < 0) {return divfloor(-A, -B);} return (A - safemod(A, B)) / B;}
ll divceil(ll A, ll B) {if (B < 0) {return divceil(-A, -B);} return divfloor(A + B - 1, B);}
#define FINALANS(A) do {cout << (A) << '\n'; exit(0);} while (false)

int main()
{
  ll N;
  cin >> N;
  vector<ll> B(N, 0);
  for (ll i = 0; i < N; i++)
  {
    ll K;
    cin >> K;
    for (ll j = 0; j < K; j++)
    {
      ll C;
      cin >> C;
      C--;
      B.at(i) |= (1LL << C);
    }
  }

  const ll M = 12;
  vector<vector<mint>> dp(N + 1, vector<mint>((1LL << M), 0));
  dp.at(0).at((1LL << M) - 1) = 1;
  for (ll i = 0; i < N; i++)
  {
    for (ll b = 0; b < (1LL << M); b++)
    {
      ll nb = b & B.at(i);
      dp.at(i + 1).at(nb) += dp.at(i).at(b);
      dp.at(i + 1).at(b) += dp.at(i).at(b);
    }
  }

  ll ans = dp.at(N).at(0).val();
  cout << ans << endl;
}