from sys import stdin
def primes(n):
	sieve=[True]*n
	for i in xrange(3,int(n**0.5)+1,2):
		if sieve[i]:
			sieve[i*i::2*i]=[False]*((n-i*i-1)/(2*i)+1)
	return [2]+[i for i in xrange(3,n,2) if sieve[i]]
T=int(stdin.next())
for _t in range(T):
	deepa=0
	N=int(stdin.next())
	prime_list=primes(N)
	for x in prime_list:
		if(N-x in prime_list):
			print 'Deepa'
			deepa=1
			break
	if(deepa==0):
		print 'Arjit'