跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F0729. Makes And The Product

  • ID: 735
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:进阶
  • 上传者:
  • 组合数学
  • 模拟
  • 数学
  • 排序
  • 编程与模拟
  • 进阶
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

Makes And The Product

题目描述

B. Makes And The Product
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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,j,k) (i<j<k), such that ai·aj·ak is minimum possible, are there in the array? Help him with it!

Input

The first line of input contains a positive integer number n(3≤n≤105) − the number of elements in array a. The second line contains n positive integer numbers ai(1≤ai≤109) − the elements of a given array.

Output

Print one number − the quantity of triples (i,j,k) such that i,j and k are pairwise distinct and ai·aj·ak is minimum possible.

Examples
Input
4
1 1 1 1
Output
4
Input
5
1 3 2 3 4
Output
2
Input
6
1 3 3 1 3 2
Output
1
Note

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,2,3) 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,1,2) is chosen, and there's only one way to choose indices.


题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 147 题。保留原作者与原赛事署名。