Skiers

Memory limit: 32 MB

A ski team organizes a training on the Bytemountain. There is one ski lift on the northern slope of the mountain. All the ski runs lead from the upper ski lift station to the bottom one. During the training the team members will start together from the upper station and meet at the bottom one. Apart from these two points, the ski runs of the competitors cannot intersect, nor adhere to each other. All ski runs always have to lead downwards.

A map of ski runs consists of net of clearings connected by glades. Every clearing lies on a different height. Two clearings can be joint directly with at most one glade. While skiing downhill from the upper to the bottom station of ski lift, one can choose way to visit any clearing (but maybe not all in one downhill run). Ski runs can intersect only on the clearings and do not lead through tunnels, or flyovers.

Task

Write a program, which:

• reads from the standard input the map of ski runs,
• determines maximum number of competitors who can participate in training,
• write the result to the standard output.

Input

In the first line of the standard input, there is an integer , that equals to the number of the clearings, .

In each of the next lines there is a sequence of integers separated by single spaces. Numbers in the ()-th line describe, to which clearings the downhill glades from the -th clearing lead. First integer in the line - is the number of these clearings, and the following integers are their numbers, which are ordered according to the arrangement of glades leading to them, in east to west direction. The clearings are numbered from 1 to . The upper station of the ski lift can be found on the clearing number 1 and the bottom one on the clearing number .

Output

The first and the only one line of the standard output should consist of exactly one integer - the maximum number of skiers able to take part in the training.

Example

For the input data:

15
5 3 5 9 2 4
1 9
2 7 5
2 6 8
1 7
1 10
2 14 11
2 10 12
2 13 10
3 13 15 12
2 14 15
1 15
1 15
1 15

the correct result is:

3

Task author: Marcin Kubica.