/** gnu specific **/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/** contains everything I need in std **/
#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(S) ((int)S.size())
#define FOR(i, st_, n) for(int i = st_; i < n; ++i)
#define RFOR(i, n, end_) for(int i = (n)-1; i >= end_; --i)
#define x first
#define y second
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef unsigned long long ull;
typedef long double LD;
typedef pair<ull, ull> pull;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
using namespace std;
#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif

set<vector<int>> S;

// a is subset of b
bool is_subset(const vector<int>& a, const vector<int>& b)
{
	int j =0;
	FOR(i,0,sz(b))
	{
		if(b[i]==a[j])
			++j;
		if(j==sz(a))
			return true;
	}
	return false;
}

void enumerate(const vector<int>& a, vector<int>& res,int p, int k)
{
	if(k==0)
	{
		for(auto&vec:S)
		{
			if(is_subset(res,vec))
				return;
		}
		auto b=res;
		sort(all(b));
		S.insert(move(b));
		return;
	}
	if(p==-1)return;
	res.pb(a[p]);
	enumerate(a,res,p-1,k-1);
	res.pop_back();
	enumerate(a,res,p-1,k);
}

int solve()
{
	int n;
	if(!(cin>>n))return 1;
	vector<vector<string>> a(n);
	FOR(i,0,n)
	{
		int k;
		cin>>k;
		FOR(j,0,k)
		{
			string s;
			cin>>s;
			a[i].pb(s);
		}
	}
	vector<vector<int>> b(n);
	{
		int ctr=0;
		map<string,int> s;
		int i=0;
		for(auto& vec:a)
		{
			for(auto& word: vec)
			{
				if(s.find(word)==s.end())
				{
					s[word]=ctr++;
				}
				b[i].pb(s[word]);
			}
			++i;
		}
	}
	vector<int> tmp;
	for(auto& vec: b)
	{
		enumerate(vec,tmp,sz(vec)-1,sz(vec)/2);
	}
	cout<<sz(S)<<"\n";
    return 0;
}

int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    int TET = 1e9;
    //cin >> TET;
    for (int i = 1; i <= TET; i++)
    {
        if (solve())
        {
            break;
        }
#ifdef ONPC
        cout << "__________________________" << endl;
#endif
    }
#ifdef ONPC
    cerr << endl << "finished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec" << endl;
#endif
}