{"raw_statement":[{"iden":"problem statement","content":"Given is a permutation $P$ of ${1, 2, \\ldots, N}$.\nFor a pair $(L, R) (1 \\le L \\lt R \\le N)$, let $X_{L, R}$ be the second largest value among $P_L, P_{L+1}, \\ldots, P_R$.\nFind $\\displaystyle \\sum_{L=1}^{N-1} \\sum_{R=L+1}^{N} X_{L,R}$."},{"iden":"constraints","content":"*   $2 \\le N \\le 10^5$\n*   $1 \\le P_i \\le N$\n*   $P_i \\neq P_j $ $(i \\neq j)$\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$\n$P_1$ $P_2$ $\\ldots$ $P_N$"},{"iden":"sample input 1","content":"3\n2 3 1"},{"iden":"sample output 1","content":"5\n\n$X_{1, 2} = 2, X_{1, 3} = 2$, and $X_{2, 3} = 1$, so the sum is $2 + 2 + 1 = 5$."},{"iden":"sample input 2","content":"5\n1 2 3 4 5"},{"iden":"sample output 2","content":"30"},{"iden":"sample input 3","content":"8\n8 2 7 3 4 5 6 1"},{"iden":"sample output 3","content":"136"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}