Count Distinct Values in the Range 0..1000

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem

Given $a_0,a_1,\ldots,a_{n-1}$ with $0\le a_i\le1000$, let

Compute the number of distinct values $D=|S|$.

Input

The first line contains $n$. The second line contains $n$ integers in $[0,1000]$.

Output

Print $D$, the number of distinct values.

Subtask

Subtask 1 (20 points): $1\le n\le 10$, $0\le a_i\le 1000$.

Subtask 2 (30 points): $1\le n\le 5000$, $0\le a_i\le 1000$.

Subtask 3 (50 points): $1\le n\le 2\cdot 10^5$, $0\le a_i\le 1000$.

Example

Input

9
3 3 0 7 3 7 1000 0 5

Output

5

Explanation

The output follows directly from the mathematical definition above.