#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using vi = vector<int>;
using vvi = vector<vector<int>>;
using vl = vector<ll>;
using vvl = vector<vector<ll>>;
using pl = pair<ll,ll>;
using pi = pair<int,int>;
#define all(x) x.begin(),x.end()
#define rep(i,j,n) for (long long i = j; i < (long long)(n); i++)
#define _GLIBCXX_DEBUG
const ll MOD = 1000000007;
const ll MOD2 = 998244353;
const int INF = ((1<<30)-1);
const ll LINF = (1LL<<60);
const double PI = 3.141592653589793238;
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; }
//(a+b-1)/b

template<int MOD> struct Fp {  
    long long val;
    constexpr Fp(long long v = 0) noexcept : val(v % MOD) {
        if (val < 0) val += MOD;
    }
    constexpr int getmod() { return MOD; }
    constexpr Fp operator - () const noexcept {
        return val ? MOD - val : 0;
    }
    constexpr Fp operator + (const Fp& r) const noexcept { return Fp(*this) += r; }
    constexpr Fp operator - (const Fp& r) const noexcept { return Fp(*this) -= r; }
    constexpr Fp operator * (const Fp& r) const noexcept { return Fp(*this) *= r; }
    constexpr Fp operator / (const Fp& r) const noexcept { return Fp(*this) /= r; }
    constexpr Fp& operator += (const Fp& r) noexcept {
        val += r.val;
        if (val >= MOD) val -= MOD;
        return *this;
    }
    constexpr Fp& operator -= (const Fp& r) noexcept {
        val -= r.val;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr Fp& operator *= (const Fp& r) noexcept {
        val = val * r.val % MOD;
        return *this;
    }
    constexpr Fp& operator /= (const Fp& r) noexcept {
        long long a = r.val, b = MOD, u = 1, v = 0;
        while (b) {
            long long t = a / b;
            a -= t * b; swap(a, b);
            u -= t * v; swap(u, v);
        }
        val = val * u % MOD;
        if (val < 0) val += MOD;
        return *this;
    }
    constexpr bool operator > (const Fp& r) const noexcept {
		return this->val > r.val;
	}
	constexpr bool operator < (const Fp& r) const noexcept {
		return this->val < r.val;
	}
	constexpr bool operator == (const Fp& r) const noexcept {
        return this->val == r.val;
    }
    constexpr bool operator != (const Fp& r) const noexcept {
        return this->val != r.val;
    }
    friend constexpr ostream& operator << (ostream &os, const Fp<MOD>& x) noexcept {
        return os << x.val;
    }
    friend constexpr Fp<MOD> modpow(const Fp<MOD> &a, long long n) noexcept {
        if (n == 0) return 1;
        auto t = modpow(a, n / 2);
        t = t * t;
        if (n & 1) t = t * a;
        return t;
    }
};
using mint = Fp<MOD2>;


signed main(){
    //cout << fixed << setprecision(10);
    ios::sync_with_stdio(0), cin.tie(0);
    int n; cin >> n;
    vector<int> c[n];
    vi idx(0);
    rep(i,0,n){
        int k; cin >> k;
        rep(j,0,k){
            int a; cin >> a;
            idx.push_back(a);
            c[i].push_back(a);
        }
    }
    sort(all(idx));
    idx.erase(unique(all(idx)) , idx.end());
    vector<ll> v(n);
    rep(i,0,n){
        ll tmp = 0;
        for(auto d:c[i]){
            ll j = lower_bound(all(idx),d) - idx.begin();
            tmp |= (1LL<<j);
        }
        v[i] = tmp;
    }
    int sz = idx.size();
    mint dp[n+1][(1<<sz)];
    rep(i,0,n+1)rep(j,0,(1<<sz))dp[i][j] = 0;
    dp[0][(1<<sz)-1] = 1;
    rep(i,0,n){
        rep(j,0,(1<<sz)){
            dp[i+1][j] += dp[i][j];
            dp[i+1][j&v[i]] += dp[i][j];
        }
    }
   // rep(i,0,n)cout << v[i] << endl;
   // mint ans = 0;
    /*rep(i,0,(1<<sz)){
        cout << i << " " << dp[n][i] << endl;
    }*/
    if(idx.size() == 0)dp[n][0] -= 1;
    cout << dp[n][0] << endl;


	return 0;
}