# Sets Union

Execution time limit is 1 second

Runtime memory usage limit is 128 megabytes

Sets union is very difficult. Therefore find the amount of numbers that present in at least one of the given sets.

## Input

The first line contains the number of sets n (1 ≤ n ≤ 10). The next n lines contain the sets in format: k `a[1]`

... `a[k]`

(1 ≤ k ≤ 1000, `-10^9`

≤ `a[i]`

≤ `10^9`

).

## Output

Print the amount of numbers that present in at least one of the given sets.

## Examples

Input #1

Answer #1

Input #2

Answer #2

Input #3

Answer #3

Submissions 5K

Acceptance rate 72%