Given an array of integers, the task is to count all the triplets such that sum of two elements equal the third element. When counting triplets, only count the unique ones. A unique triplet is when all three numbers of the triplet put in increasing order are unique, for example, the triples `1 2 3`

and `3 2 1`

are not unique, but the triplets `8 5 3`

and `8 4 4`

are unique. The triplets themselves do not necessarily have to be unique, this means that `8 4 4`

can be possible, as long as the 2 `4`

s do not have the same index.

#### Input

The first line of input contains , denoting the size of the array.

The second line of the input contains space separated elements , the elements of the array.

#### Output

Output the number of unique triplets in the array, if there are no such triplets, output `-1`

.

#### Constraints

#### Sample Input 1

```
4
1 5 3 2
```

#### Sample Output 1

`2`

#### Explanation Of Sample 1

There are such triplets, `1, 2, 3`

and `2, 3, 5`

.

#### Sample Input 2

```
3
3 2 7
```

#### Sample Output 2

`-1`

## Comments

Got segmentation errors that made me so confused, I once tried adding a "cout" instruction and it changes the result, somehow. GG for everyone

Hints to not TLE with PY3?

Don't use PY3 and learn basic math.

Is the test data wrong or is everyone just bad?

I'll have to check the test-data