No tag edit access

A. Olympiad

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputThe recent All-Berland Olympiad in Informatics featured *n* participants with each scoring a certain amount of points.

As the head of the programming committee, you are to determine the set of participants to be awarded with diplomas with respect to the following criteria:

- At least one participant should get a diploma.
- None of those with score equal to zero should get awarded.
- When someone is awarded, all participants with score not less than his score should also be awarded.

Determine the number of ways to choose a subset of participants that will receive the diplomas.

Input

The first line contains a single integer *n* (1 ≤ *n* ≤ 100) — the number of participants.

The next line contains a sequence of *n* integers *a*_{1}, *a*_{2}, ..., *a*_{n} (0 ≤ *a*_{i} ≤ 600) — participants' scores.

It's guaranteed that at least one participant has non-zero score.

Output

Print a single integer — the desired number of ways.

Examples

Input

4

1 3 3 2

Output

3

Input

3

1 1 1

Output

1

Input

4

42 0 0 42

Output

1

Note

There are three ways to choose a subset in sample case one.

- Only participants with 3 points will get diplomas.
- Participants with 2 or 3 points will get diplomas.
- Everyone will get a diploma!

The only option in sample case two is to award everyone.

Note that in sample case three participants with zero scores cannot get anything.

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jun/24/2018 09:46:23 (d2).

Desktop version, switch to mobile version.

User lists

Name |
---|