1
  2
  3
  4
  5
  6
  7
  8
  9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 66
 67
 68
 69
 70
 71
 72
 73
 74
 75
 76
 77
 78
 79
 80
 81
 82
 83
 84
 85
 86
 87
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
#include <bits/stdc++.h>
#include <numeric>
#include <unistd.h>
#include <vector>
using namespace std;

#define ll long long
#define pb push_back
#define F first
#define S second
#define pii pair<int,int>
#define vi vector<int>
#define vpii vector<pii>

#define loop(i,n) sloop(0,i,n)
#define sloop(s, i, n) for(int i=(s);i<(n);i++)
#define rloop(i,n) rsloop(0,i,n)
#define rsloop(s,i,n) for(int i=(n);i-->(s);)

#define all(v) (v).begin(),(v).end()

#define nie {cout<<"No\n";return;}
#define tak {cout<<"Yes\n";return;}

#ifdef DEBUG
#define DBG cout << __LINE__ << endl;
#else 
#define DBG
#endif 

//int xses[8] = {-1,1,0,0,-1,1,1,-1};
//int yses[8] = {0,0,-1,1,-1,1,-1,1};

#define int ll

void solve()
{
	int n;
	cin>>n;

	vector<vi>v(n);
	vector<vi> dp(n);
	{
		int z;
		cin>>z;
		v[0].assign(z,0);
		dp[0].assign(z,0);
	}

	sloop(1,i,n){
		int k;
		cin>>k;
		v[i].resize(k);
		dp[i].assign(k,0);
		loop(j,k)cin>>v[i][j];
	}

	int res=0;

	for(int i=n-1;i>=0;i--){
		for(int &j:dp[i])j=max(j,1ll);
		res=max(res,accumulate(all(dp[i]),0ll));

		loop(j,(int)v[i].size()){
			if(!v[i][j])continue;
			dp[i-1][v[i][j]-1]+=dp[i][j];
		}
	}


	cout<<res<<'\n';

}

signed main()
{
	cin.tie(0);
	ios_base::sync_with_stdio(0);

	int t=1;


	//cin>>t;
	loop(i,t)
	{
	#ifdef DEBUG

		if(t!=1)
		{
			cout<<"Test no. "<<i+1<<endl;
		}
	#endif
	
		solve();
	}

	#ifdef DEBUG
	cout << '\n';
	#endif
	return 0;
}