Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

D. Spider's Web

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputPaw the Spider is making a web. Web-making is a real art, Paw has been learning to do it his whole life. Let's consider the structure of the web.

There are *n* main threads going from the center of the web. All main threads are located in one plane and divide it into *n* equal infinite sectors. The sectors are indexed from 1 to *n* in the clockwise direction. Sectors *i* and *i* + 1 are adjacent for every *i*, 1 ≤ *i* < *n*. In addition, sectors 1 and *n* are also adjacent.

Some sectors have bridge threads. Each bridge connects the two main threads that make up this sector. The points at which the bridge is attached to the main threads will be called attachment points. Both attachment points of a bridge are at the same distance from the center of the web. At each attachment point exactly one bridge is attached. The bridges are adjacent if they are in the same sector, and there are no other bridges between them.

A cell of the web is a trapezoid, which is located in one of the sectors and is bounded by two main threads and two adjacent bridges. You can see that the sides of the cell may have the attachment points of bridges from adjacent sectors. If the number of attachment points on one side of the cell is not equal to the number of attachment points on the other side, it creates an imbalance of pulling forces on this cell and this may eventually destroy the entire web. We'll call such a cell unstable. The perfect web does not contain unstable cells.

Unstable cells are marked red in the figure. Stable cells are marked green.

Paw the Spider isn't a skillful webmaker yet, he is only learning to make perfect webs. Help Paw to determine the number of unstable cells in the web he has just spun.

Input

The first line contains integer *n* (3 ≤ *n* ≤ 1000) — the number of main threads.

The *i*-th of following *n* lines describe the bridges located in the *i*-th sector: first it contains integer *k*_{i} (1 ≤ *k*_{i} ≤ 10^{5}) equal to the number of bridges in the given sector. Then follow *k*_{i} different integers *p*_{ij} (1 ≤ *p*_{ij} ≤ 10^{5}; 1 ≤ *j* ≤ *k*_{i}). Number *p*_{ij} equals the distance from the attachment points of the *j*-th bridge of the *i*-th sector to the center of the web.

It is guaranteed that any two bridges between adjacent sectors are attached at a different distance from the center of the web. It is guaranteed that the total number of the bridges doesn't exceed 10^{5}.

Output

Print a single integer — the number of unstable cells in Paw the Spider's web.

Examples

Input

7

3 1 6 7

4 3 5 2 9

2 8 1

4 3 7 6 4

3 2 5 9

3 6 3 8

3 4 2 9

Output

6

Codeforces (c) Copyright 2010-2017 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Dec/13/2017 12:16:50 (c6).

Desktop version, switch to mobile version.

User lists

Name |
---|