Music Festival

Vitya is a boy who loves listening to music. He follows the news of his favorite bands closely, so he knows that $n$ albums come out this Friday, and the $i$-th album has $k_i$ tracks. As a devoted fan, Vitya has already listened to every track that will be released soon. He knows that the coolness of the $j$-th track of the $i$-th album is $a_{i,j}$. Vitya has a friend, Masha, whom he wants to invite to a music festival where his favorite bands perform. Before she agrees, she must listen to the new releases. Each time Masha hears a track that is cooler than all the tracks before it, she gets 1 point of impression. Albums can only be played in full, and the tracks inside an album cannot be reordered. Find an order of the albums that gives Masha the largest possible impression, so that she is sure to go to the festival with him.

The first line contains a single integer $n$ ($1 \le n \le 200000$), the number of albums. Each album is described by two lines. The first line contains a single integer $k_i$ ($1 \le k_i \le 200000$), the number of tracks in the $i$-th album. The next line contains $k_i$ integers $a_{i,1}, a_{i,2}, a_{i,3}, \ldots, a_{i,k_i}$ ($1 \le a_{i,j} \le 200000$), the coolness of the tracks in the $i$-th album. It is guaranteed that the sum of all $k_i$ does not exceed 200000.

Print a single number, the maximum impression that Masha can get.

In the first sample, the optimal order is to listen to albums 4, 2, 3, and 1. In that case Masha hears the tracks in this order: 1; 7; 8, 6; 4, 9, 4, 6, 8, and gets 4 points of impression. In the second sample, you must listen to album 1 first, then album 4, and albums 2 and 3 in any order. In that case Masha gets points for every track in albums 1 and 4, and nothing for albums 2 and 3.