{"raw_statement":[{"iden":"problem statement","content":"You are given an integer sequence $A = (A_1, A_2, \\dots, A_N)$ of length $N$.  \nYou can perform the following operation any number of times, possibly zero:\n\n*   Choose an integer pair $(i, j)$ satisfying $1 \\leq i \\lt j \\leq N$, and replace $A_i$ with $A_i + 1$ and $A_j$ with $A_j - 1$.\n\nDetermine whether it is possible to make $A$ a non-decreasing sequence through the operations.\nYou are given $T$ test cases. Solve each of them."},{"iden":"constraints","content":"*   $1 \\leq T \\leq 2 \\times 10^5$\n*   $2 \\leq N \\leq 2 \\times 10^5$\n*   $0 \\leq A_i \\leq 10^9$\n*   The sum of $N$ over all test cases is at most $2 \\times 10^5$.\n*   All input values are integers."},{"iden":"input","content":"The input is given from Standard Input in the following format. Here, $\\mathrm{case}_i$ denotes the $i$\\-th test case.\n\n$T$\n$\\mathrm{case}_1$\n$\\mathrm{case}_2$\n$\\vdots$\n$\\mathrm{case}_T$\n\nEach test case is given in the following format:\n\n$N$\n$A_1$ $A_2$ $\\dots$ $A_N$"},{"iden":"sample input 1","content":"3\n3\n1 7 5\n2\n9 0\n10\n607 495 419 894 610 636 465 331 925 724"},{"iden":"sample output 1","content":"Yes\nNo\nYes\n\nIn the first test case, you can make $A$ into a non-decreasing sequence by performing the following operations:\n\n*   Choose $(i, j) = (1, 2)$. After the operation, $A$ is $(2, 6, 5)$.\n*   Choose $(i, j) = (1, 2)$. After the operation, $A$ is $(3, 5, 5)$.\n\nIn the second test case, you cannot make $A$ into a non-decreasing sequence no matter how you perform the operations."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}