B"After returning from the army Makes received a gift -- an array a consisting of n positive integer numbers. He hadn't been solving problems for a long time, so he became interested to answer a particular question: how many triples of indices (i, xe2 x80 x89 j, xe2 x80 x89 k) (i xe2 x80 x89< xe2 x80 x89j xe2 x80 x89< xe2 x80 x89k), such that ai xc2 xb7aj xc2 xb7ak is minimum possible, are there in the array? Help him with it! The first line of input contains a positive integer number n (3 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89105) -- the number of elements in array a. The second line contains n positive integer numbers ai (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ai xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109) -- the elements of a given array. Print one number -- the quantity of triples (i, xe2 x80 x89 j, xe2 x80 x89 k) such that i, xe2 x80 x89 j and k are pairwise distinct and ai xc2 xb7aj xc2 xb7ak is minimum possible. In the first example Makes always chooses three ones out of four, and the number of ways to choose them is 4. In the second example a triple of numbers (1, xe2 x80 x892, xe2 x80 x893) is chosen (numbers, not indices). Since there are two ways to choose an element 3, then the answer is 2. In the third example a triple of numbers (1, xe2 x80 x891, xe2 x80 x892) is chosen, and there's only one way to choose indices. "...