#ifndef LOCAL
#define FAST_IO
#endif

// ============
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32) (n); ++i)
#define REP3(i, m, n) for (i32 i = (i32) (m); i < (i32) (n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32) (n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using u128 = __uint128_t;
using i32 = signed int;
using i64 = signed long long;
using i128 = __int128_t;
using f64 = double;
using f80 = long double;

template <typename T>
using Vec = vector<T>;

template <typename T>
bool chmin(T &x, const T &y) {
    if (x > y) {
        x = y;
        return true;
    }
    return false;
}
template <typename T>
bool chmax(T &x, const T &y) {
    if (x < y) {
        x = y;
        return true;
    }
    return false;
}

istream &operator>>(istream &is, i128 &x) {
    i64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, i128 x) {
    os << (i64) x;
    return os;
}
istream &operator>>(istream &is, u128 &x) {
    u64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, u128 x) {
    os << (u64) x;
    return os;
}

[[maybe_unused]] constexpr i32 INF = 1000000100;
[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;
struct SetUpIO {
    SetUpIO() {
#ifdef FAST_IO
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
#endif
        cout << fixed << setprecision(15);
    }
} set_up_io;
// ============

#ifdef DEBUGF
#else
#define DBG(x) (void) 0
#endif

int main() {
    constexpr i32 N = 19;
    array<Vec<i32>, N> sts;
    REP(i, N) {
        i32 l;
        cin >> l;
        sts[i].reserve(l);
        while (l --> 0) {
            i32 n;
            cin >> n;
            --n;
            sts[i].push_back(n);
        }
    }
    array<Vec<u64>, 2> dp;
    REP(i, 2) {
        dp[i].resize(1 << N, 0);
    }
    dp[0][0] = 1;
    REP(i, N) {
        array<Vec<u64>, 2> ndp;
        REP(j, 2) {
            ndp[j].resize(1 << N, 0);
        }
        REP(k, 1 << N) for (i32 l : sts[i]) {
            if (k & (1 << l)) {
                continue;
            }
            i32 cnt = __builtin_popcount(k >> l) & 1;
            if (cnt == 0) {
                ndp[0][k ^ (1 << l)] += dp[0][k];
                ndp[1][k ^ (1 << l)] += dp[1][k];
            } else {
                ndp[1][k ^ (1 << l)] += dp[0][k];
                ndp[0][k ^ (1 << l)] += dp[1][k];
            }
        }
        dp = ndp;
    }
    cout << dp[0][(1 << N) - 1] << ' ' << dp[1][(1 << N) - 1] << '\n';
}