ABCDEF - ABCDEF


You are given a set S of integers between -30000 and 30000 (inclusive).

Find the total number of sextuples  that satisfy: 

 

Input

The first line contains integer N (1 ≤ N ≤ 100), the size of a set S.

Elements of S are given in the next N lines, one integer per line. Given numbers will be distinct.

Output

Output the total number of plausible sextuples.

Examples

Input:
1
1

Output:
1
Input:
2
2
3

Output:
4
Input:
2
-1
1

Output:
24
Input:
3
5
7
10

Output:
10



hide comments
kapillamba4: 2017-01-29 15:14:09

is it even possible to solve this problem in around 0.04 seconds ? how are the top guys able to do it, seems impossible to me :|
took me 1.02 seconds using unordered maps and 1.07 seconds using vectors.

Last edit: 2017-01-29 17:09:42
jatin9533: 2017-01-21 17:38:05

can anyone please explain the first two test cases i.e. for n=1 & n=2

vunnamtej: 2017-01-12 10:32:05

1.25s with bounds and 1.51s with binary search modified

n963: 2016-12-29 14:52:47

AC!!

Last edit: 2017-01-05 05:28:28
Aditya krishna namdeo: 2016-12-15 20:32:52

d!=0 :)

sas1905: 2016-11-15 16:19:23

AC in first go..:)

anroc: 2016-11-08 23:26:41

shvkppl: binary-search is just a way to solve it, and not the most efficient one, IMHO.

shvkppl: 2016-11-04 17:43:34

is this actually a binary-search problem?

adityaronanki: 2016-10-20 15:51:50

can some one please explain me the question by solving a testcase manually....since i didnt understand the question

himanshi12: 2016-10-13 14:06:16

Last edit: 2016-10-13 14:06:54

Added by:Luka Kalinovcic
Date:2009-07-13
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:own problem