#include <map>
#include <set>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <cctype>
#include <cstdio>
#include <limits>
#include <string>
#include <vector>
#include <cassert>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <fstream>
#include <iomanip>
#include <numeric>
#include <sstream>
#include <utility>
#include <iostream>
#include <algorithm>
#include <functional>

#define stop exit(0)
#define nc -1
#define eps 1e-10
#define inf 1000000000
#define mod 1000000007
#define mp make_pair

#define fill(array,value) memset(array,value,sizeof(array))
#define f(i,beg,end) for(int i=beg; i<=end; i++)
#define F(i,beg,end) for(int i=beg; i>=end; i--)
#define Max(a,b) ( (a>b)?a:b )
#define Min(a,b) ( (a<b)?a:b )
#define pi 3.1415926535897932384626433832
#define iread(var) scanf("%d",&var)
#define dread(var) scanf("%f",&var)
#define lread(var) scanf("%lld",&var)
#define input(name) freopen(name,"r",stdin)
#define output(name) freopen(name,"w",stdout)
typedef unsigned long long ull;
typedef unsigned int ui;
typedef long double ld;
typedef long long ll;

using namespace std;

int n;
vector <int> days[16];
int numDays[16];

void init()
{
    cin >> n;
    f(i,1,n)
    {
        cin >> numDays[i];
        days[i].resize(numDays[i]);
        f(j,0,numDays[i]-1)
            cin >> days[i][j];
    }
}

int dp[16][(1 << 11)];

inline bool ok(int food, int day) {
    if (days[food].empty()) return true;

    f(i,0,days[food].size()-1) {
        if (days[food][i] == day) {
            return false;
        }
    }
    return true;
}

int ans(int day, int mask) {

    if (dp[day][mask] != -1) {
        return dp[day][mask];
    }

    int ret = 0;
    f(i,0,n-1) {
        if (mask & (1 << i)) { // (i+1)-th food is available
            if (ok(i+1,day)) {
                ret += ans(day-1, mask-(1<<i));
            }
        }
    }

    return (dp[day][mask] = ret);
}

void solve()
{
    fill(dp,-1);
    dp[0][0] = 1;

    cout << ans(n,(1<<n)-1) << endl;
}

int main()
{
//	input("test.txt");
    input("diet.in");
    output("diet.out");

	int numberOfTests = 1;
//	cin >> numberOfTests;

	f(i,1,numberOfTests)
	{
		init();
		solve();
	}

	return 0;
}