#include <cstdio>
#include <vector>

//#define DEBUG

using namespace std;

class room
{
public:
int prv,cnt;

	room();
	room(const int p,const int c);
	room(const room &s);
room operator=(const room &s);
};

room::room()
{
	prv = 0;
	cnt = 0;
}

room::room(const int p,const int c)
{
	prv = p;
	cnt = c;
}

room::room(const room &s)
{
	prv = s.prv;
	cnt = s.cnt;
}

room room::operator=(const room &s)
{
	prv = s.prv;
	cnt = s.cnt;

	return *this;
}

///////////////////////////////////////

class day
{
public:
int K;
vector<room> P;

	day();
	day(const int k);
	day(const day &s);
day operator=(const day &s);
int add(const int s);
void print() const;
};

day::day()
{
	K = 1;
	P.clear();
}

day::day(const int k)
{
	K = k;
	P.clear();
}

day::day(const day &s)
{
	K = s.K;
	for (vector<room>::const_iterator i = s.P.begin(); i != s.P.end(); ++i)
		P.push_back(*i);
}

day day::operator=(const day &s)
{
	K = s.K;
	for (vector<room>::const_iterator i = s.P.begin(); i != s.P.end(); ++i)
		P.push_back(*i);
	
	return *this;
}

int day::add(const int s)
{
	P.push_back(room(s,0));
	
	return s;
}

void day::print() const
{
#ifdef DEBUG
	printf("%d : %d\n",K,P.size());
	for (vector<room>::const_iterator i = P.begin(); i != P.end(); ++i)
		printf("%d ",*i);
	printf("\n");
#endif
}

/////////////////////////////////////////////////

class conf
{
public:
vector<day> D;

	conf();
	conf(const int k);
	conf(const conf &s);
conf operator=(const conf &s);
int setD(const int d);
int add(const int d,const int k);
void print() const;
int ret();
};

conf::conf()
{
	D.clear();
}

conf::conf(const int k)
{
	D.clear();
	for (int i = 0; i < k; i++)
		D.push_back(day(i+1));
}

conf::conf(const conf &s)
{
	for (vector<day>::const_iterator i = s.D.begin(); i != s.D.end(); ++i)
		D.push_back(*i);
}

conf conf::operator=(const conf &s)
{
	for (vector<day>::const_iterator i = s.D.begin(); i != s.D.end(); ++i)
		D.push_back(*i);

	return *this;
}

int conf::setD(const int d)
{
	D.clear();
	for (int i = 0; i < d; i++)
		D.push_back(day(i+1));
	
	return d;
}

int conf::add(const int d,const int k)
{
	if (d < 1 || d > D.size())
	{
#ifdef DEBUG
		printf("Out of range!\n");
#endif
		return 0;
	}
	
	D[d-1].add(k);
	
	return k;
}

void conf::print() const
{
#ifdef DEBUG
	for (vector<day>::const_iterator i = D.begin(); i != D.end(); ++i)
	{
		printf("%d : ",i->K);
		for (vector<room>::const_iterator j = i->P.begin(); j != i->P.end(); ++j)
			printf("%d(%d) ",j->prv,j->cnt);
		printf("\n");
	}
#endif
}

int conf::ret()
{
int m,p;

	for (int i = D.size()-1; i >= 0; i--)
	{
		for (int j = D[i].P.size()-1; j >= 0; j--)
		{
			if (D[i].P[j].cnt == 0)
			{
				D[i].P[j].cnt = 1;
				if (D[i].P[j].prv > 0) D[i-1].P[D[i].P[j].prv-1].cnt++;
#ifdef DEBUG
				printf("Debug: day=%d room=%d prv=%d new person\n",i,j,D[i].P[j].prv);
#endif
			}
			else
			{
				if (D[i].P[j].prv > 0) D[i-1].P[D[i].P[j].prv-1].cnt += D[i].P[j].cnt;
#ifdef DEBUG
				printf("Debug: day=%d room=%d prv=%d already is %d\n",i,j,D[i].P[j].prv,D[i].P[j].cnt);
#endif
			}
		}
	}
	
	m = 0;
	for (int i = 0; i < D.size(); i++)
	{
		p = 0;
		for (int j = 0; j < D[i].P.size(); j++)
			p += D[i].P[j].cnt;
		if (m < p) m = p;
//		printf("m=%d p=%d\n",m,p);
	}
	
	return m;
}

/////////////////////////////////////////////////

int main()
{
int K,k,N,n,p;
conf C;

	scanf("%d %d",&K,&N);

	C.setD(K);
	for (n = 0; n < N; n++)
		C.add(1,0);
	
	for (k = 1; k < K; k++)
	{
		scanf("%d",&N);
		for (n = 0; n < N; n++)
		{
			scanf("%d",&p);
			C.add(k+1,p);
		}
	}
	
#ifdef DEBUG
		C.print();
#endif
	printf("%d\n",C.ret());
#ifdef DEBUG
		C.print();
#endif

	return 0;
}