#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return std::vector(arg, init);
    else return std::vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

#include <atcoder/modint>
using mint = atcoder::modint998244353;

int main() {
    int n, m = 0; cin >> n;
    auto c = vec<int>(0, n);
    for (auto &v : c) {
        int k; cin >> k;
        while (k--) {
            int b; cin >> b;
            v |= 1 << (b - 1);
            chmax(m, b);
        }
    }

    auto dp = vec<mint>(uns, n + 1, 1 << m);

    dp[0][(1 << m) - 1] = 1;
    for (int i = 1; i <= n; ++i) {
        int v = c[i - 1];
        for (int j = 0; j < (1 << m); ++j) {
            dp[i][j] += dp[i - 1][j];
            dp[i][v & j] += dp[i - 1][j];
        }
    }

    cout << (dp[n][0] - (m == 0)).val() << endl;
}