The Bitlandians are quite weird people. They have very peculiar customs.

As is customary, Uncle J. wants to have *n* eggs painted for Bitruz (an ancient Bitland festival). He has asked G. and A. to do the work.

The kids are excited because just as is customary, they're going to be paid for the job! 

Overall uncle J. has got *n* eggs. G. named his price for painting each egg. Similarly, A. named his price for painting each egg. It turns out that for each egg the sum of the money both A. and G. want for the painting equals 1000.

Uncle J. wants to distribute the eggs between the children so as to give each egg to exactly one child. Also, Uncle J. wants the total money paid to A. to be different from the total money paid to G. by no more than 500.

Help Uncle J. Find the required distribution of eggs or otherwise say that distributing the eggs in the required manner is impossible.
The first line contains integer *n* (1 ≤ *n* ≤ 10<sup class="upper-index">6</sup>) — the number of eggs.

Next *n* lines contain two integers *a*<sub class="lower-index">*i*</sub> and *g*<sub class="lower-index">*i*</sub> each (0 ≤ *a*<sub class="lower-index">*i*</sub>, *g*<sub class="lower-index">*i*</sub> ≤ 1000; *a*<sub class="lower-index">*i*</sub> + *g*<sub class="lower-index">*i*</sub> = 1000): *a*<sub class="lower-index">*i*</sub> is the price said by A. for the *i*-th egg and *g*<sub class="lower-index">*i*</sub> is the price said by G. for the *i*-th egg.
n = int(input())
eggs = []
for _ in range(n):
    a, g = map(int, input().split())
    eggs.append((a, g))

Sa = 0
Sg = 0
distribution = ""

for a, g in eggs:
    if Sa + a <= Sg + g + 500:
        Sa += a
        distribution += "A"
    else:
        Sg += g
        distribution += "G"

if abs(Sa - Sg) > 500:
    print("-1")
else:
    print(distribution)