<? echo $row['title']." - ".$MSG_PROBLEM."

给定N个序列，编号为1到N

第i个序列的长度是Li，第i个序列的第j个元素是aij。

请你确定有多少个互不相同的序列，请输出答案。

You are given $N$ sequences numbered $1$ to $N$ .

Sequence

i

has a length of

L_i

and its

j

-th element

\leq j \leq L_i)

a_{i,j}

.
Sequence

i

and Sequence

j

are considered the same when

L_i = L_j

and

a_{i,k} = a_{j,k}

for every

k

\leq k \leq L_i)

.
How many different sequences are there among Sequence

1

through Sequence

N

Constraints

$\leq N \leq 2 \times 10^5$
$\leq L_i \leq 2 \times 10^5$ $\leq i \leq N)$
$\leq a_{i,j} \leq 10^{9}$ $\leq i \leq N, 1 \leq j \leq L_i)$
The total number of elements in the sequences, $\sum_{i=1}^N L_i$ , does not exceed $\times 10^5$ .
All values in input are integers.

Input

Input is given from Standard Input in the following format:

 $N$  $L_1$  $a_{1,1}$  $a_{1,2}$  $\dots$  $a_{1,L_1}$  $L_2$  $a_{2,1}$  $a_{2,2}$  $\dots$  $a_{2,L_2}$  $\vdots$  $L_N$  $a_{N,1}$  $a_{N,2}$  $\dots$  $a_{N,L_N}$

Output

Print the number of different sequences.

2272: Counting Arrays

Description

Constraints

Input

Output

Sample Input Copy

Sample Output Copy

HINT

Source/Category