Alien War Human race is under attack. ‘T’ aliens from planet Mars are attacking Earth. Each alien has a gun with power defined using two numbers written on the gun ‘a’ and ‘b’ s.t. power of the gun is ‘a’ multiplied by ‘a’ ‘b’ number of times. (eg if a =2 and b=4 then p=2*2*2*2=16). We have some humans left on earth out of which half are children and cannot fight. Others can fight and are called warriors. The count of number of humans is same as twice the number of aliens. Like aliens every warrior has a gun numbered ‘c’ and ‘d’. You are a computer scientist from Planet Jupiter who is analysing the war, your job is to output the result of every battle where ith warrior fights with ith alien(1<=i<=T). The person with higher power wins the battle. If both have guns of equal power then warrior kills the alien with his powerful hands.The manufacturer for both aliens’ guns and warriors’ guns loves number 2. So all the numbers a, b, c, d are a power of 2. Input First line of the input consists of a single integer ‘T’ denoting the number of test cases, followed by T lines with each line containing description of gun of ith alien and ith warriori.e. four space separated integers a, b, c and d. Output T lines containing one string each. Each line for the winner of each battle i.e. ‘Alien’ or ‘Warrior’ . Constraints 1 ≤ T ≤ 2000 1 ≤ a,b,c,d ≤ 2^25 a, b, c, d are all powers of 2 i.e of the form 2^n Time Limit: 1 sec Sample Input 5 1 1 1 1 8 2 4 2 4 2 2 4 128 2 8 4 16 1024 4 1024 Sample Output Warrior Alien Warrior Alien Alien Solution By: Deepanker Aggarwal Tested By: Kshitiz Bakshi .