{"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\"\u003eSequence is beautiful and the beauty of an integer sequence is defined as follows: removes all but the first element from every consecutive group of equivalent elements of the sequence (i.e. unique function in C++ STL) and the summation of rest integers is the beauty of the sequence.\u003cbr\u003e\u003cbr\u003eNow you are given a sequence $A$ of $n$ integers $\\{a_1,a_2,...,a_n\\}$. You need find the summation of the beauty of all the sub-sequence of $A$. As the answer may be very large, print it modulo $10^9+7$.\u003cbr\u003e\u003cbr\u003eNote: In mathematics, a sub-sequence is a sequence that can be derived from another sequence by deleting some elements without changing the order of the remaining elements. For example $\\{1,3,2\\}$ is a sub-sequence of $\\{1, 4, 3, 5, 2, 1\\}$.\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 line contains an integer $n$ $(1 \\le n \\le 10^5)$, indicating the size of the sequence. The following line contains $n$ integers $a_1,a_2,...,a_n$, denoting the sequence $(1 \\le a_i \\le 10^9)$.\u003cbr\u003e\u003cbr\u003eThe sum of values $n$ for all the test cases does not exceed $2000000$."}},{"title":"Output","value":{"format":"HTML","content":"For each test case, print the answer modulo $10^9+7$ in a single line.\u003cbr\u003e"}},{"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\n5\r\n1 2 3 4 5\r\n4\r\n1 2 1 3\r\n5\r\n3 3 2 1 2\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e240\r\n54\r\n144\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}