{"trustable":true,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003ePeter has a number sequence $a_1, a_2, ..., a_n$. Let $g(l,r)$ be the maximum value of the subsequence $a_{l},a_{l+1},...,a_{r}$ and $f(l,r)\u003d\\displaystyle\\sum_{i\u003dl}^{r}[a_i \u003d g(l,r)]$. Note that $[\\text{condition}] \u003d 1$ if $\\text{condition}$ is true, or $0$ otherwise.\u003cbr\u003e\u003cbr\u003ePeter wants to know the number of integer pairs $l$ and $r$ $(l \\le r)$ such that $f(l,r)\u003dk$, for every integer $k \\in \\{1, 2, ..., n\\}$.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"There are multiple test cases. The first line of input contains an integer $T$ indicating the number of test cases. For each test case:\u003cbr\u003e\u003cbr\u003eThe first contains an integer $n$ $(1 \\le n \\le 60000)$ -- the length of the sequence. The second line contains $n$ integers $a_1,a_2,...,a_n$ $(1 \\le a_i \\le n)$."}},{"title":"Output","value":{"format":"HTML","content":"For each test case, output an integer $S \u003d \\displaystyle\\sum_{k\u003d1}^{n}k \\oplus z_k$, where $z_k$ is the number of integer pairs $l$ and $r$ $(l \\le r)$ that $f(l,r)\u003dk$ and $\\oplus$ denotes the bitwise exclusive or operation."}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e3\r\n3\r\n1 2 3\r\n4\r\n1 1 1 1\r\n6\r\n1 2 2 1 1 2\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e12\r\n12\r\n36\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}