#include <bits/stdc++.h>
#define pb push_back
#define ll long long
#define int __int128_t
using namespace std;
const int N = 1e2 + 5;
vector<int> kraw[N];
ll n;
int dp[N], k[N];
int NWW(int a, int b){
	int res = a*b/__gcd(a, b);
	return res;
}
std::ostream&
operator<<( std::ostream& dest, __int128_t value )
{
    std::ostream::sentry s( dest );
    if ( s ) {
        __uint128_t tmp = value < 0 ? -value : value;
        char buffer[ 128 ];
        char* d = std::end( buffer );
        do
        {
            -- d;
            *d = "0123456789"[ tmp % 10 ];
            tmp /= 10;
        } while ( tmp != 0 );
        if ( value < 0 ) {
            -- d;
            *d = '-';
        }
        int len = std::end( buffer ) - d;
        if ( dest.rdbuf()->sputn( d, len ) != len ) {
            dest.setstate( std::ios_base::badbit );
        }
    }
    return dest;
}
void dfs(){
	for(int i=2;i<=n;i++) dp[i]=0;
	for(int i=1;i<=n;i++){
		if(k[i]&&dp[i]%k[i]){
			int pom = NWW(dp[i], k[i]);
			pom/=dp[i];
			dp[1]*=pom;
			dfs();
			return;
		}
		for(auto v : kraw[i]){
			dp[v]+=(dp[i]/k[i]);
		}
	}
}
signed main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++){
		long long x;
		cin>>x;
		k[i]=x;
		for(int j=1;j<=k[i];j++){
			long long a;
			cin>>a;
			kraw[i].pb(a);
		}
	}
	dp[1]=1;
	dfs();
	cout<<dp[1];
	return 0;
}