#include <bits/stdc++.h>
using namespace std;
#define ll long long

ll n;
vector<ll>now,nextt;

int main()
{
    scanf("%lld",&n);
    for(ll i=1;i<=n;i++)
    {
        ll val;
        scanf("%lld",&val);
        now.push_back(val);
    }
    nextt.push_back(now[0]);
    for(ll i=1;i<now.size();i++)
    {
        if(now[i]==nextt[nextt.size()-1])continue;
        else nextt.push_back(now[i]);
    }
    for(ll i=0;i<nextt.size();i++){if(i>0)printf(" ");cout<<nextt[i];}
    printf("\n");
    return 0;
}



### Prompt

Your challenge is to write a cpp solution to the following problem:

For a sequence of integers $A = \\{a_0, a_1, ..., a_{n-1}\\}$ which is sorted by ascending order, eliminate all equivalent elements.

Constraints

* $1 \leq n \leq 100,000$
* $-1000,000,000 \leq a_i \leq 1,000,000,000$
* $a_0 \leq a_1 \leq ... \leq a_{n-1}$

Input

A sequence is given in the following format.


$n$
$a_0 \; a_1 \; ,..., \; a_{n-1}$


Output

Print the sequence after eliminating equivalent elements in a line. Separate adjacency elements by a space character.

Example

Input

4
1 2 2 4


Output

1 2 4

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
#define ll long long

ll n;
vector<ll>now,nextt;

int main()
{
    scanf("%lld",&n);
    for(ll i=1;i<=n;i++)
    {
        ll val;
        scanf("%lld",&val);
        now.push_back(val);
    }
    nextt.push_back(now[0]);
    for(ll i=1;i<now.size();i++)
    {
        if(now[i]==nextt[nextt.size()-1])continue;
        else nextt.push_back(now[i]);
    }
    for(ll i=0;i<nextt.size();i++){if(i>0)printf(" ");cout<<nextt[i];}
    printf("\n");
    return 0;
}



```