#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i=0; i<n; i++)
#define pb push_back
typedef long long ll;

int main() {
    cin.tie(0); ios::sync_with_stdio(false);
    
    int N = 19;
    ll dp[1<<N][2];
    rep(S, 1<<N) rep(i, 2) dp[S][i] = 0ll;
    dp[0][0] = 1ll;
    
    int inv[1<<N][N];
    rep(S, 1<<N) rep(i, N) inv[S][i] = 0;
    rep(S, 1<<N) {
        int cnt[N]; fill(cnt, cnt+N, 0);
        rep(i, N) if ((S>>i)&1) cnt[i] = 1;
        for (int i=1; i<N; i++) cnt[i] += cnt[i-1];
        rep(i, N) inv[S][i] = N-cnt[i];
    }
    
    vector<int> bits[N+1];
    rep(S, 1<<N) {
        int c = 0;
        rep(i, N) if ((S>>i)&1) c++;
        bits[c].pb(S);
    }
    rep(i, N) reverse(bits[i].begin(), bits[i].end());
    
    rep(t, N) {
        int L; cin >> L;
        int A[L]; rep(i, L) cin >> A[i];
        rep(i, L) A[i]--;
        for (int S : bits[t]) {
            for (int Ai: A) {
                if ((S>>Ai)&1) continue;
                dp[S|(1<<Ai)][inv[S][Ai]%2] += dp[S][0];
                dp[S|(1<<Ai)][(inv[S][Ai]%2+1)%2] += dp[S][1];
            }
        }
    }
    
    cout << dp[(1<<N)-1][0] << " " << dp[(1<<N)-1][1] << endl;
}