{"trustable":true,"sections":[{"title":"","value":{"format":"MD","content":"Utkarsh is forced to play yet another game with Ashish.\n\nIn this game there are $N$ piles, $i^{th}$ pile contains $A_i$ stones. **Utkarsh moves first**.\n\nIn Utkarsh\u0027s turn, Ashish chooses a pile (which contains at least $1$ stone), then Utkarsh removes any non-zero number of stones from that pile. Similarly, in Ashish\u0027s turn, Utkarsh chooses a pile with at least $1$ stone, then Ashish removes any non-zero number of stones from that pile. The player who makes the last move wins.\n\nDetermine the winner of the game if both players play optimally."}},{"title":"Input Format","value":{"format":"MD","content":"- The first line contains $T$ - the number of test cases. Then the test cases follow.\n- The first line of each test case contains an integer $N$ - the number of piles.\n- The second line of each test case contains $N$ space separated integers $A_1, A_2, \\dots, A_N$, where $A_i$ denotes the number of stones in the $i^{th}$ pile."}},{"title":"Output Format","value":{"format":"MD","content":"For each test case, output on one line `Utkarsh` if Utkarsh wins the game, else output `Ashish`.\n\nYou may print each character of the string in uppercase or lowercase (for example, the strings `Utkarsh`, `utkarsh`, `UTKARSH` and `uTkArSh` will all be treated as identical)."}},{"title":"Constraints","value":{"format":"MD","content":"- $1 \\leq T \\leq 200$\n- $1 \\leq N \\leq 10^3$\n- $1 \\leq A_i \\leq 10^9$\n"}},{"title":"Sample 1","value":{"format":"MD","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\n1\n10\n4\n1 1 1 1\n3\n3 3 1\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eUtkarsh\nAshish\nAshish\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n- **Test case $1$:** Since there is only $1$ pile, Ashish can choose only that pile for Utkarsh and he will remove all the stones from that pile and thus win the game.\n- **Test case $2$:** No matter which player choose which pile, the game will run for exactly $4$ turns and thus Ashish will win the game."}}]}