Shil got an array of N integers as a present on his birthday. But he didn't liked it. Shil wants to make this array beautiful. Shil considers an array A₁,A₂,A₃ . . . A_N beautiful if A₁ > A_N. Inorder to make it beautiful Shil can swap any two numbers in the array. Also Shil can perform this operation any number of times on any adjacent pairs of integers in the array A.Find the number of ways in which Shil can make this array beautiful.Two ways are considered same if resulting array after making all the swaps have same A₁ and A_N.

Input

First line of input contains an integer N denoting the number of elements in an array A. Next line of input contains N space separated integers denoting A₁,A₂,A₃ . . . A_N respectively.

Output

Number of ways in which you can make given array beautiful.

Constraints

1 ≤ N ≤ 10⁶
1 ≤ A_i ≤ 10⁶

Warning

Prefer to use fast I/O methods.