Score : $200$ points

Problem Statement

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

Sequence $i$ has a length of $L\_i$ and its $j$-th element $(1 \leq j \leq L\_i)$ is $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$ $(1 \leq k \leq L\_i)$.

How many different sequences are there among Sequence $1$ through Sequence $N$?

Constraints

• $1 \leq N \leq 2 \times 10^5$

• $1 \leq L\_i \leq 2 \times 10^5$ $(1 \leq i \leq N)$

• $0 \leq a\_{i,j} \leq 10^{9}$ $(1 \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 $2 \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.

---

Sample Input 1

4

2 1 2

2 1 1

2 2 1

2 1 2

Sample Output 1

3

Sample Input $1$ contains four sequences:

• Sequence $1$ : $(1, 2)$

• Sequence $2$ : $(1, 1)$

• Sequence $3$ : $(2, 1)$

• Sequence $4$ : $(1, 2)$

Except that Sequence $1$ and Sequence $4$ are the same, these sequences are pairwise different, so we have three different sequences.

---

Sample Input 2

5

1 1

1 1

1 2

2 1 1

3 1 1 1

Sample Output 2

4

Sample Input $2$ contains five sequences:

• Sequence $1$ : $(1)$

• Sequence $2$ : $(1)$

• Sequence $3$ : $(2)$

• Sequence $4$ : $(1, 1)$

• Sequence $5$ : $(1, 1, 1)$

---

Sample Input 3

1

1 1

Sample Output 3

1