Utkarsh is forced to play yet another game with Ashish.

In this game there are N piles, i^{th} pile contains A_{i} stones. Utkarsh moves first.

In Utkarsh's 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's 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.

Determine the winner of the game if both players play optimally.

------ Input Format ------ 

- The first line contains T - the number of test cases. Then the test cases follow.
- The first line of each test case contains an integer N - the number of piles.
- 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.

------ Output Format ------ 

For each test case, output on one line Utkarsh if Utkarsh wins the game, else output Ashish.

You 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).

------ Constraints ------ 

$1 ≤ T ≤ 200$
$1 ≤ N ≤ 10^{3}$
$1 ≤ A_{i} ≤ 10^{9}$

----- Sample Input 1 ------ 
3
1
10
4
1 1 1 1
3
3 3 1

----- Sample Output 1 ------ 
Utkarsh
Ashish
Ashish

----- explanation 1 ------ 
- 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.
- 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.

Difficulty: VERY_HARD
Tags: Game theory

Ad-hoc

Starter code:

Solutions:
for _ in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	numgoes = a.count(1)
	numbig = n - numgoes
	if numbig == 0:
		print({0: 'Utkarsh', 1: 'Ashish'}[1 - numgoes % 2])
	else:
		print({0: 'Utkarsh', 1: 'Ashish'}[numgoes % 2])


t = int(input())
while t > 0:
	n = int(input())
	a = list(map(int, input().split()))
	if min(a) > 1:
		print('Utkarsh')
	elif max(a) == 1:
		if n % 2 == 0:
			print('Ashish')
		else:
			print('Utkarsh')
	else:
		c = a.count(1)
		if c % 2 == 1:
			print('Ashish')
		else:
			print('Utkarsh')
	t -= 1


for i in range(int(input())):
	n = int(input())
	a = list(map(int, input().split()))
	c = d = 0
	for j in range(n):
		if a[j] == 1:
			c += 1
		else:
			d += 1
	if d == 0:
		if c % 2 != 0:
			print('Utkarsh')
		else:
			print('Ashish')
	elif c % 2 != 0:
		print('Ashish')
	else:
		print('Utkarsh')


from functools import reduce
t = int(input())
for _ in range(t):
	n = int(input())
	a = list(map(int, input().split()))
	c1 = a.count(1)
	if c1 == n:
		print('Utkarsh' if c1 % 2 != 0 else 'Ashish')
	else:
		print('Utkarsh' if c1 % 2 == 0 else 'Ashish')


for tc in range(int(input())):
	n = int(input())
	ls = list(map(int, input().split()))
	(one, oth) = (0, 0)
	for x in ls:
		if x == 1:
			one += 1
		else:
			oth += 1
	if oth == 0:
		if one % 2 == 0:
			print('Ashish')
		else:
			print('Utkarsh')
	elif one == 0:
		print('Utkarsh')
	elif one % 2 == 0:
		print('Utkarsh')
	else:
		print('Ashish')


for t in range(int(input())):
	N = int(input())
	A = list(map(int, input().split()))
	count1 = A.count(1)
	countExtra = N - count1
	if countExtra == 0:
		if count1 % 2 == 0:
			print('Ashish')
		else:
			print('Utkarsh')
	elif count1 % 2 == 0:
		print('Utkarsh')
	else:
		print('Ashish')


for i in range(int(input())):
	n = int(input())
	l = list(map(int, input().split()))
	m = 0
	for j in l:
		if j != 1:
			m += 1
	if n % 2 == 1:
		if m == 1 or m == 0:
			print('Utkarsh')
			continue
		if m % 2 == 0:
			print('Ashish')
		else:
			print('Utkarsh')
	else:
		if m == 1 or m == 0:
			print('Ashish')
			continue
		if m % 2 == 0:
			print('Utkarsh')
		else:
			print('Ashish')


for i in range(int(input())):
	n = int(input())
	a = [int(j) for j in input().split()]
	cnt = 0
	for j in a:
		if j == 1:
			cnt += 1
	if cnt == n:
		print('Utkarsh' if cnt % 2 else 'Ashish')
	else:
		print('Utkarsh' if cnt % 2 == 0 else 'Ashish')


_ = input
for t in range(int(_())):
	(N, X) = (int(_()), sum([int(x) < 2 for x in _().split()]))
	print(['Ashi', 'Utkar'][X % 2 ^ (N - X >= 1)] + 'sh')


(_, Z) = (input, [[0] + [1] * 1001] + [[1] + [0] * 1001])
for t in range(int(_())):
	(N, X) = (int(_()), [int(x) < 2 for x in _().split()].count(1))
	print(['Ashi', 'Utkar'][Z[X % 2][N - X]] + 'sh')


DP = [[i % 2] + [1 - i % 2 for _ in range(1001)] for i in range(1001)]
for _ in range(int(input())):
	input()
	A = [int(x) < 2 for x in input().split()]
	(X, Y) = (A.count(1), A.count(0))
	print(['Ashish', 'Utkarsh'][DP[X][Y]])


N = 1001
DP = [[0 for _ in range(N + 1)] for __ in range(N + 1)]
for i in range(1, N, 2):
	DP[i][0] = 1
for j in range(1, N):
	DP[0][j] = 1 - (DP[1][j - 1] & DP[0][j - 1])
	for i in range(1, N):
		DP[i][j] = not (DP[i - 1][j] or (DP[i + 1][j - 1] and DP[i][j - 1]))
for _ in range(int(input())):
	input()
	A = [min(int(x), 2) for x in input().split()]
	(X, Y) = (A.count(1), A.count(2))
	print(['Ashish', 'Utkarsh'][DP[X][Y]])


t = int(input())
for _ in range(t):
	n = int(input())
	arr = [1 if i == 1 else 0 for i in [int(j) for j in input().strip().split()]]
	if n == 1:
		print('Utkarsh')
		continue
	a = sum(arr)
	b = n - a
	if b == 0:
		if a % 2 == 1:
			print('Utkarsh')
		else:
			print('Ashish')
	elif a == 0:
		print('Utkarsh')
	elif a % 2:
		print('Ashish')
	else:
		print('Utkarsh')


def solve(A, N):
	(count1, count2) = (0, 0)
	for i in A:
		if i == 1:
			count1 += 1
		else:
			count2 += 1
	if count1 == N:
		if count1 & 1 == 1:
			print('Utkarsh')
		else:
			print('Ashish')
	elif count1 & 1 == 1:
		print('Ashish')
	else:
		print('Utkarsh')
T = int(input())
for _ in range(T):
	N = int(input())
	A = list(map(int, input().split()))
	solve(A, N)


import sys, os, io
input = sys.stdin.readline
PI = 3.141592653589793
INF = float('inf')
MOD = 1000000007

def bin32(num):
	return '{0:032b}'.format(num)

def add(x, y):
	return (x + y) % MOD

def sub(x, y):
	return (x - y + MOD) % MOD

def mul(x, y):
	return x * y % MOD

def gcd(x, y):
	if y == 0:
		return x
	return gcd(y, x % y)

def lcm(x, y):
	return x * y // gcd(x, y)

def power(x, y):
	res = 1
	x %= MOD
	while y != 0:
		if y & 1:
			res = mul(res, x)
		y >>= 1
		x = mul(x, x)
	return res

def mod_inv(n):
	return power(n, MOD - 2)

def prob(p, q):
	return mul(p, power(q, MOD - 2))

def ii():
	return int(input())

def li():
	return [int(i) for i in input().split()]

def ls():
	return [i for i in input().split()]
for t in range(ii()):
	t += 1
	n = ii()
	a = li()
	one = a.count(1)
	if n % 2 == 1:
		if one == n or one % 2 == 0:
			print('Utkarsh')
		else:
			print('Ashish')
	elif one <= n - 2 and one % 2 == 0:
		print('Utkarsh')
	else:
		print('Ashish')


for _ in range(int(input())):
	N = int(input())
	A = list(map(int, input().split()))
	num_ones = A.count(1)
	num_bigs = N - num_ones
	if num_bigs == 0:
		print({0: 'Utkarsh', 1: 'Ashish'}[1 - num_ones % 2])
	else:
		print({0: 'Utkarsh', 1: 'Ashish'}[num_ones % 2])


for _ in range(int(input())):
	n = int(input())
	arr = list(map(int, input().split()))
	maxi = 0
	mini = n
	for i in arr:
		if i > 1:
			maxi += 2
		else:
			maxi += 1
	if mini == maxi:
		if mini % 2 == 0:
			print('Ashish')
		else:
			print('Utkarsh')
	elif maxi % 2 == 0:
		print('Utkarsh')
	else:
		print('Ashish')


tt = 1
tt = int(input())
for _ in range(tt):
	n = int(input())
	a = list(map(int, input().split()))
	co = 0
	for i in a:
		if i == 1:
			co += 1
	if co == n:
		if co % 2:
			print('Utkarsh')
		else:
			print('Ashish')
	elif co == 0:
		print('Utkarsh')
	elif co % 2 == 0:
		print('Utkarsh')
	else:
		print('Ashish')


def main():
	n = int(input())
	arr = list(map(int, input().split()))
	one = 0
	two = 0
	for x in arr:
		if x == 1:
			one += 1
		else:
			two += 1
	if one == 0:
		return 'Utkarsh'
	if two == 0:
		if one % 2 == 0:
			return 'Ashish'
		else:
			return 'Utkarsh'
	if one % 2 == 1:
		return 'Ashish'
	return 'Utkarsh'
for _ in range(int(input())):
	print(main())


import math

def solve():
	n = int(input())
	l = list(map(int, input().split()))
	no = 0
	o = 0
	for i in l:
		if i > 1:
			no += 1
		else:
			o += 1
	if no > 0:
		if o % 2:
			print('Ashish')
		else:
			print('Utkarsh')
	elif o % 2:
		print('Utkarsh')
	else:
		print('Ashish')
T = int(input())
for _ in range(T):
	solve()


def divisors(M):
	d = []
	i = 1
	while M >= i ** 2:
		if M % i == 0:
			d.append(i)
			if i ** 2 != M:
				d.append(M // i)
		i = i + 1
	return d

def popcount(x):
	x = x - (x >> 1 & 1431655765)
	x = (x & 858993459) + (x >> 2 & 858993459)
	x = x + (x >> 4) & 252645135
	x = x + (x >> 8)
	x = x + (x >> 16)
	return x & 127

def eratosthenes(n):
	res = [0 for i in range(n + 1)]
	prime = set([])
	for i in range(2, n + 1):
		if not res[i]:
			prime.add(i)
			for j in range(1, n // i + 1):
				res[i * j] = 1
	return prime

def factorization(n):
	res = []
	for p in prime:
		if n % p == 0:
			while n % p == 0:
				n //= p
			res.append(p)
	if n != 1:
		res.append(n)
	return res

def euler_phi(n):
	res = n
	for x in range(2, n + 1):
		if x ** 2 > n:
			break
		if n % x == 0:
			res = res // x * (x - 1)
			while n % x == 0:
				n //= x
	if n != 1:
		res = res // n * (n - 1)
	return res

def ind(b, n):
	res = 0
	while n % b == 0:
		res += 1
		n //= b
	return res

def isPrimeMR(n):
	d = n - 1
	d = d // (d & -d)
	L = [2, 3, 5, 7, 11, 13, 17]
	for a in L:
		t = d
		y = pow(a, t, n)
		if y == 1:
			continue
		while y != n - 1:
			y = y * y % n
			if y == 1 or t == n - 1:
				return 0
			t <<= 1
	return 1

def findFactorRho(n):
	from math import gcd
	m = 1 << n.bit_length() // 8
	for c in range(1, 99):
		f = lambda x: (x * x + c) % n
		(y, r, q, g) = (2, 1, 1, 1)
		while g == 1:
			x = y
			for i in range(r):
				y = f(y)
			k = 0
			while k < r and g == 1:
				ys = y
				for i in range(min(m, r - k)):
					y = f(y)
					q = q * abs(x - y) % n
				g = gcd(q, n)
				k += m
			r <<= 1
		if g == n:
			g = 1
			while g == 1:
				ys = f(ys)
				g = gcd(abs(x - ys), n)
		if g < n:
			if isPrimeMR(g):
				return g
			elif isPrimeMR(n // g):
				return n // g
			return findFactorRho(g)

def primeFactor(n):
	i = 2
	ret = {}
	rhoFlg = 0
	while i * i <= n:
		k = 0
		while n % i == 0:
			n //= i
			k += 1
		if k:
			ret[i] = k
		i += 1 + i % 2
		if i == 101 and n >= 2 ** 20:
			while n > 1:
				if isPrimeMR(n):
					(ret[n], n) = (1, 1)
				else:
					rhoFlg = 1
					j = findFactorRho(n)
					k = 0
					while n % j == 0:
						n //= j
						k += 1
					ret[j] = k
	if n > 1:
		ret[n] = 1
	if rhoFlg:
		ret = {x: ret[x] for x in sorted(ret)}
	return ret

def divisors(n):
	res = [1]
	prime = primeFactor(n)
	for p in prime:
		newres = []
		for d in res:
			for j in range(prime[p] + 1):
				newres.append(d * p ** j)
		res = newres
	res.sort()
	return res

def xorfactorial(num):
	if num == 0:
		return 0
	elif num == 1:
		return 1
	elif num == 2:
		return 3
	elif num == 3:
		return 0
	else:
		x = baseorder(num)
		return 2 ** x * ((num - 2 ** x + 1) % 2) + function(num - 2 ** x)

def xorconv(n, X, Y):
	if n == 0:
		res = [X[0] * Y[0] % mod]
		return res
	x = [X[i] + X[i + 2 ** (n - 1)] for i in range(2 ** (n - 1))]
	y = [Y[i] + Y[i + 2 ** (n - 1)] for i in range(2 ** (n - 1))]
	z = [X[i] - X[i + 2 ** (n - 1)] for i in range(2 ** (n - 1))]
	w = [Y[i] - Y[i + 2 ** (n - 1)] for i in range(2 ** (n - 1))]
	res1 = xorconv(n - 1, x, y)
	res2 = xorconv(n - 1, z, w)
	former = [(res1[i] + res2[i]) * inv for i in range(2 ** (n - 1))]
	latter = [(res1[i] - res2[i]) * inv for i in range(2 ** (n - 1))]
	former = list(map(lambda x: x % mod, former))
	latter = list(map(lambda x: x % mod, latter))
	return former + latter

def merge_sort(A, B):
	(pos_A, pos_B) = (0, 0)
	(n, m) = (len(A), len(B))
	res = []
	while pos_A < n and pos_B < m:
		(a, b) = (A[pos_A], B[pos_B])
		if a < b:
			res.append(a)
			pos_A += 1
		else:
			res.append(b)
			pos_B += 1
	res += A[pos_A:]
	res += B[pos_B:]
	return res

class UnionFindVerSize:

	def __init__(self, N):
		self._parent = [n for n in range(0, N)]
		self._size = [1] * N
		self.group = N

	def find_root(self, x):
		if self._parent[x] == x:
			return x
		self._parent[x] = self.find_root(self._parent[x])
		stack = [x]
		while self._parent[stack[-1]] != stack[-1]:
			stack.append(self._parent[stack[-1]])
		for v in stack:
			self._parent[v] = stack[-1]
		return self._parent[x]

	def unite(self, x, y):
		gx = self.find_root(x)
		gy = self.find_root(y)
		if gx == gy:
			return
		self.group -= 1
		if self._size[gx] < self._size[gy]:
			self._parent[gx] = gy
			self._size[gy] += self._size[gx]
		else:
			self._parent[gy] = gx
			self._size[gx] += self._size[gy]

	def get_size(self, x):
		return self._size[self.find_root(x)]

	def is_same_group(self, x, y):
		return self.find_root(x) == self.find_root(y)

class WeightedUnionFind:

	def __init__(self, N):
		self.parent = [i for i in range(N)]
		self.size = [1 for i in range(N)]
		self.val = [0 for i in range(N)]
		self.flag = True
		self.edge = [[] for i in range(N)]

	def dfs(self, v, pv):
		stack = [(v, pv)]
		new_parent = self.parent[pv]
		while stack:
			(v, pv) = stack.pop()
			self.parent[v] = new_parent
			for (nv, w) in self.edge[v]:
				if nv != pv:
					self.val[nv] = self.val[v] + w
					stack.append((nv, v))

	def unite(self, x, y, w):
		if not self.flag:
			return
		if self.parent[x] == self.parent[y]:
			self.flag = self.val[x] - self.val[y] == w
			return
		if self.size[self.parent[x]] > self.size[self.parent[y]]:
			self.edge[x].append((y, -w))
			self.edge[y].append((x, w))
			self.size[x] += self.size[y]
			self.val[y] = self.val[x] - w
			self.dfs(y, x)
		else:
			self.edge[x].append((y, -w))
			self.edge[y].append((x, w))
			self.size[y] += self.size[x]
			self.val[x] = self.val[y] + w
			self.dfs(x, y)

class Dijkstra:

	class Edge:

		def __init__(self, _to, _cost):
			self.to = _to
			self.cost = _cost

	def __init__(self, V):
		self.G = [[] for i in range(V)]
		self._E = 0
		self._V = V

	@property
	def E(self):
		return self._E

	@property
	def V(self):
		return self._V

	def add_edge(self, _from, _to, _cost):
		self.G[_from].append(self.Edge(_to, _cost))
		self._E += 1

	def shortest_path(self, s):
		import heapq
		que = []
		d = [10 ** 15] * self.V
		d[s] = 0
		heapq.heappush(que, (0, s))
		while len(que) != 0:
			(cost, v) = heapq.heappop(que)
			if d[v] < cost:
				continue
			for i in range(len(self.G[v])):
				e = self.G[v][i]
				if d[e.to] > d[v] + e.cost:
					d[e.to] = d[v] + e.cost
					heapq.heappush(que, (d[e.to], e.to))
		return d

def Z_algorithm(s):
	N = len(s)
	Z_alg = [0] * N
	Z_alg[0] = N
	i = 1
	j = 0
	while i < N:
		while i + j < N and s[j] == s[i + j]:
			j += 1
		Z_alg[i] = j
		if j == 0:
			i += 1
			continue
		k = 1
		while i + k < N and k + Z_alg[k] < j:
			Z_alg[i + k] = Z_alg[k]
			k += 1
		i += k
		j -= k
	return Z_alg

class BIT:

	def __init__(self, n, mod=0):
		self.BIT = [0] * (n + 1)
		self.num = n
		self.mod = mod

	def query(self, idx):
		res_sum = 0
		mod = self.mod
		while idx > 0:
			res_sum += self.BIT[idx]
			if mod:
				res_sum %= mod
			idx -= idx & -idx
		return res_sum

	def update(self, idx, x):
		mod = self.mod
		while idx <= self.num:
			self.BIT[idx] += x
			if mod:
				self.BIT[idx] %= mod
			idx += idx & -idx
		return

class dancinglink:

	def __init__(self, n, debug=False):
		self.n = n
		self.debug = debug
		self._left = [i - 1 for i in range(n)]
		self._right = [i + 1 for i in range(n)]
		self.exist = [True for i in range(n)]

	def pop(self, k):
		if self.debug:
			assert self.exist[k]
		L = self._left[k]
		R = self._right[k]
		if L != -1:
			if R != self.n:
				(self._right[L], self._left[R]) = (R, L)
			else:
				self._right[L] = self.n
		elif R != self.n:
			self._left[R] = -1
		self.exist[k] = False

	def left(self, idx, k=1):
		if self.debug:
			assert self.exist[idx]
		res = idx
		while k:
			res = self._left[res]
			if res == -1:
				break
			k -= 1
		return res

	def right(self, idx, k=1):
		if self.debug:
			assert self.exist[idx]
		res = idx
		while k:
			res = self._right[res]
			if res == self.n:
				break
			k -= 1
		return res

class SparseTable:

	def __init__(self, A, merge_func, ide_ele):
		N = len(A)
		self.merge_func = merge_func
		self.lg = [0] * (N + 1)
		for i in range(2, N + 1):
			self.lg[i] = self.lg[i >> 1] + 1
		self.pow_2 = [pow(2, i) for i in range(20)]
		self.table = [None] * (self.lg[N] + 1)
		st0 = self.table[0] = [a for a in A]
		b = 1
		for i in range(self.lg[N]):
			st0 = self.table[i + 1] = [self.merge_func(u, v) for (u, v) in zip(st0, st0[b:])]
			b <<= 1

	def query(self, s, t):
		b = t - s + 1
		m = self.lg[b]
		return self.merge_func(self.table[m][s], self.table[m][t - self.pow_2[m] + 1])

class BinaryTrie:

	class node:

		def __init__(self, val):
			self.left = None
			self.right = None
			self.max = val

	def __init__(self):
		self.root = self.node(-10 ** 15)

	def append(self, key, val):
		pos = self.root
		for i in range(29, -1, -1):
			pos.max = max(pos.max, val)
			if key >> i & 1:
				if pos.right is None:
					pos.right = self.node(val)
					pos = pos.right
				else:
					pos = pos.right
			elif pos.left is None:
				pos.left = self.node(val)
				pos = pos.left
			else:
				pos = pos.left
		pos.max = max(pos.max, val)

	def search(self, M, xor):
		res = -10 ** 15
		pos = self.root
		for i in range(29, -1, -1):
			if pos is None:
				break
			if M >> i & 1:
				if xor >> i & 1:
					if pos.right:
						res = max(res, pos.right.max)
					pos = pos.left
				else:
					if pos.left:
						res = max(res, pos.left.max)
					pos = pos.right
			elif xor >> i & 1:
				pos = pos.right
			else:
				pos = pos.left
		if pos:
			res = max(res, pos.max)
		return res

def solveequation(edge, ans, n, m):

	def dfs(v):
		used[v] = True
		r = ans[v]
		for (to, dire, id) in edge[v]:
			if used[to]:
				continue
			y = dfs(to)
			if dire == -1:
				x[id] = y
			else:
				x[id] = -y
			r += y
		return r
	x = [0] * m
	used = [False] * n
	for v in range(n):
		if used[v]:
			continue
		y = dfs(v)
		if y != 0:
			return False
	return x

class slope_trick:

	def __init__(self):
		self.L = [10 ** 17]
		self.R = [10 ** 17]
		self.min_f = 0
		self.x_left = 0
		self.x_right = 0

	def add_right(self, a):
		a -= self.x_left
		l0 = -self.L[0]
		self.min_f = self.min_f + max(0, l0 - a)
		if l0 <= a:
			a += self.x_left
			a -= self.x_right
			heappush(self.R, a)
		else:
			heappush(self.L, -a)
			a = -heappop(self.L)
			a += self.x_left
			a -= self.x_right
			heappush(self.R, a)

	def add_left(self, a):
		a -= self.x_right
		r0 = self.R[0]
		self.min_f = self.min_f + max(0, a - r0)
		if a <= r0:
			a += self.x_right
			a -= self.x_left
			heappush(self.L, -a)
		else:
			heappush(self.R, a)
			a = heappop(self.R)
			a += self.x_right
			a -= self.x_left
			heappush(self.L, -a)

	def add_abs(self, a):
		self.add_left(a)
		self.add_right(a)

	def change_min_slide(self, a, b):
		self.x_left += a
		self.x_right += b

	def get_val(self, x):
		L = [-l + self.x_left for l in self.L]
		L.sort()
		R = [r + self.x_right for r in self.R]
		R.sort()
		res = self.min_f
		if 0 < L[-1]:
			L = L[::-1]
			n = len(L)
			for i in range(n):
				c0 = L[i]
				c1 = L[i + 1]
				if c1 <= x <= c0:
					res += (i + 1) * (c0 - x)
					break
				else:
					res += (i + 1) * (c0 - c1)
			return res
		elif L[-1] <= x <= R[0]:
			return res
		else:
			n = len(R)
			for i in range(n):
				c0 = R[i]
				c1 = R[i + 1]
				if c0 <= x <= c1:
					res += (i + 1) * (x - c0)
					break
				else:
					res += (i + 1) * (c1 - c0)
			return res

class SegmentTree:

	def __init__(self, init_val, segfunc, ide_ele):
		n = len(init_val)
		self.segfunc = segfunc
		self.ide_ele = ide_ele
		self.num = 1 << (n - 1).bit_length()
		self.tree = [ide_ele] * 2 * self.num
		self.size = n
		for i in range(n):
			self.tree[self.num + i] = init_val[i]
		for i in range(self.num - 1, 0, -1):
			self.tree[i] = self.segfunc(self.tree[2 * i], self.tree[2 * i + 1])

	def update(self, k, x):
		k += self.num
		self.tree[k] = x
		while k > 1:
			k >>= 1
			self.tree[k] = self.segfunc(self.tree[2 * k], self.tree[2 * k + 1])

	def query(self, l, r):
		if r == self.size:
			r = self.num
		res = self.ide_ele
		l += self.num
		r += self.num
		right = []
		while l < r:
			if l & 1:
				res = self.segfunc(res, self.tree[l])
				l += 1
			if r & 1:
				right.append(self.tree[r - 1])
			l >>= 1
			r >>= 1
		for e in right[::-1]:
			res = self.segfunc(res, e)
		return res

	def bisect_l(self, l, r, x):
		l += self.num
		r += self.num
		Lmin = -1
		Rmin = -1
		while l < r:
			if l & 1:
				if self.tree[l] <= x and Lmin == -1:
					Lmin = l
				l += 1
			if r & 1:
				if self.tree[r - 1] <= x:
					Rmin = r - 1
			l >>= 1
			r >>= 1
		if Lmin != -1:
			pos = Lmin
			while pos < self.num:
				if self.tree[2 * pos] <= x:
					pos = 2 * pos
				else:
					pos = 2 * pos + 1
			return pos - self.num
		elif Rmin != -1:
			pos = Rmin
			while pos < self.num:
				if self.tree[2 * pos] <= x:
					pos = 2 * pos
				else:
					pos = 2 * pos + 1
			return pos - self.num
		else:
			return -1
import sys, random, bisect
from collections import deque, defaultdict
from heapq import heapify, heappop, heappush
from itertools import permutations
from math import gcd, log
input = lambda : sys.stdin.readline().rstrip()
mi = lambda : map(int, input().split())
li = lambda : list(mi())
for _ in range(int(input())):
	N = int(input())
	A = li()
	M = A.count(1)
	if max(A) > 1:
		if M & 1:
			print('Ashish')
		else:
			print('Utkarsh')
	elif M & 1 == 0:
		print('Ashish')
	else:
		print('Utkarsh')