Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

A. Nastya and an Array

time limit per test

1 secondmemory limit per test

256 megabytesinput

standard inputoutput

standard outputNastya owns too many arrays now, so she wants to delete the least important of them. However, she discovered that this array is magic! Nastya now knows that the array has the following properties:

- In one second we can add an arbitrary (possibly negative) integer to all elements of the array that are not equal to zero.
- When all elements of the array become equal to zero, the array explodes.

Nastya is always busy, so she wants to explode the array as fast as possible. Compute the minimum time in which the array can be exploded.

Input

The first line contains a single integer *n* (1 ≤ *n* ≤ 10^{5}) — the size of the array.

The second line contains *n* integers *a*_{1}, *a*_{2}, ..., *a*_{n} ( - 10^{5} ≤ *a*_{i} ≤ 10^{5}) — the elements of the array.

Output

Print a single integer — the minimum number of seconds needed to make all elements of the array equal to zero.

Examples

Input

5

1 1 1 1 1

Output

1

Input

3

2 0 -1

Output

2

Input

4

5 -6 -5 1

Output

4

Note

In the first example you can add - 1 to all non-zero elements in one second and make them equal to zero.

In the second example you can add - 2 on the first second, then the array becomes equal to [0, 0, - 3]. On the second second you can add 3 to the third (the only non-zero) element.

Codeforces (c) Copyright 2010-2018 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jan/21/2019 16:08:31 (d3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|