#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
template<class T> bool chmax(T &a, const T &b) { if(a<b){a=b;return 1;}return 0;}
template<class T> bool chmin(T &a, const T &b) { if(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int L[19];
int M[19];

ll dp[1<<19][2];

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	FOR(i,19) {
		cin>>L[i];
		FOR(j,L[i]) {
			cin>>x;
			M[i]|=1<<(x-1);
		}
	}
	
	dp[0][0]=1;
	int mask;
	FOR(mask,1<<19) FOR(y,2) {
		j=__builtin_popcount(mask);
		x=0;
		for(i=18;i>=0;i--) {
			if(mask&(1<<i)) {
				x^=1;
			}
			else if(M[j]&(1<<i)) {
				dp[mask^(1<<i)][y^x]+=dp[mask][y];
			}
		}
	}
	cout<<dp[(1<<19)-1][0]<<" "<<dp[(1<<19)-1][1]<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}