#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

int main() {
  constexpr int N = 19;
  bool exist[N][N]{};
  REP(i, N) {
    int l; cin >> l;
    while (l--) {
      int a; cin >> a; --a;
      exist[i][a] = true;
    }
  }
  ll dp[2][1 << N]{}, nxt[2][1 << N]{};
  REP(i, N) {
    if (exist[i][0]) dp[i & 1][1 << i] = 1;
  }
  FOR(s, 1, N) {
    REP(i, 2) fill(nxt[i], nxt[i] + (1 << N), 0);
    for (int subset = (1 << s) - 1; subset < (1 << N);) {
      int parity = 0;
      REP(i, N) {
        if (subset >> i & 1) continue;
        if (exist[i][s]) {
          REP(j, 2) nxt[j ^ parity][subset | (1 << i)] += dp[j][subset];
        }
        parity ^= 1;
      }
      const int tmp1 = subset & -subset, tmp2 = subset + tmp1;
      subset = (((subset & ~tmp2) / tmp1) >> 1) | tmp2;
    }
    swap(dp, nxt);
  }
  cout << dp[0][(1 << N) - 1] << ' ' << dp[1][(1 << N) - 1] << '\n';
  return 0;
}