Given a permutation of number from 1 to N. Among all the subarrays, find the number of unique pairs $(a, b)$ such that $a \neq b$ and a is maximum and b is second maximum in that subarray.

Input:
First line contains an integer, N $(1 \le N \le 10^5)$. Second line contains N space separated distinct integers, $A_i$ $(1 \le A_i \le N)$, denoting the permutation.

Output:
Print the required answer.