#include <iostream>
#include <fstream>
#include <algorithm>
using namespace std;
int fruit[10],ans=0;
struct everyfruit
{
    int brpr;
    int pr[10];
} fruitpr[10];
bool ok[10][10];

int main()
{
    freopen("diet.in","r",stdin);
    freopen("diet.out","w",stdout);
    int n;
    cin>>n;
    for(int i=0;i<n;i++)
        for(int j=0;j<n;j++)
            ok[i][j]=1;
    for(int i=0;i<n;i++)
    {
        cin>>fruitpr[i].brpr;
        for(int j=0;j<fruitpr[i].brpr;j++)
        {cin>>fruitpr[i].pr[j];ok[i][fruitpr[i].pr[j]-1]=0;}
    }
    for(int i=1;i<=n;i++)
        fruit[i-1]=i;
    /**for(int i=0;i<n;i++)
       {for(int j=0;j<n;j++)
            cout<<ok[i][j]<" ";
    cout<<endl;}*/
    do
    {
        /**for(int i=0;i<n;i++)
            cout<<fruit[i]<<" ";
        cout<<endl;*/
        bool no=0;
        for(int i=0;i<n;i++)
            if(ok[i][fruit[i]-1]==0)no=1;
        if(no==0)ans++;
    }
    while(next_permutation(fruit,fruit+n));
    cout<<ans<<endl;
    return 0;
}