2017 Fall Waterloo Local ACM Contest, Problem A

Vera has five sticks of distinct lengths $l_1,l_2,l_3,l_4,l_5$. Vera may choose any three of the five sticks to form the sides of a triangle. How many different triangles can Vera make? Each triangle must have positive area and sticks cannot be bent or cut.

Input

Line $1$ contains integers $l_1,l_2,l_3,l_4,l_5$ $(1\le l_i\le 1000)$.

Output

Print one line with one integer, the number of ways to form a triangle.

Sample Input 1

1 2 3 4 5

Sample Output 1

3

Sample Input 2

1 2 4 8 16

Sample Output 2

0

Note

For the first example, the $3$ ways to form a triangle are choosing sticks $2,3,4$ or $2,4,5$ or $3,4,5$.