Bill loves to play with magnets. He has a set of N magnets. Each magnet has a strength (power).  A set is said to be Attractive if the frequency of the strongest magnet and its power both are even or both are odd. Else it is Repulsive.

Help Bill determine if the set he has is Attractive or Repulsive.

Constrains:

1 ≤ T ≤ 100

1 ≤ N ≤ 100

1 ≤ Power Of Magnet ≤ 100

Input Format:

The first line contains the number of test cases T.

First line of each test case contains a number N, the size of the set. Next line contains N space separated integers, the power of magnets.

Output Format:

Print Attractive or Repulsive accordingly for each test case.