【CF】A. Nastya and an Array

萌新的第一道CFo(*￣︶￣*)o

原题地址

A. Nastya and an Array

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Nastya 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 ≤ 105) — the size of the array.

The second line contains n integers a1, a2, ..., an ( - 105 ≤ ai ≤ 105) — 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

Copy

5
1 1 1 1 1

output

Copy

1

input

Copy

3
2 0 -1

output

Copy

2

input

Copy

4
5 -6 -5 1

output

Copy

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.

题意：给出n个数字，每次对所有非零元素加减相同值，直到所有元素的值为零；

思维题，找出有几个非零且不相等的元素即可，使用set较为简便；

#include<iostream>
#include<set>
using namespace std;
int main()
{
	int n,x,i,s=0;
	set<int>q;
	cin>>n;
	for(i=0;i<n;i++)
	{
		cin>>x;
		if(x)
		  q.insert(x);
	}
	cout<<q.size()<<endl;
	return 0;
 }