Source

This problem is adapted from Long Long OJ. All rights reserved.

Description

You have $N$ sequences and the length of the $i$-th sequence is $L_i$.

You're going to operate on these $N$ sequences:

• If the length of the $i$-th sequence is less than the $20\%$ of the sum of the lengths of all sequences, the $i$-th sequence consists letters A.
• Otherwise, the $i$-th sequence consists letters B.

Print all the sequences after the operation.

Input

The first line consists of an integer $N$.

Then $N$ lines follow. The $i$-th line of them consists of an integer $L_i$.

Output

Print all the sequences after the operation.

Samples

5
1
2
3
4
5

A
AA
BBB
BBBB
BBBBB

Tips

• $1\leq N\leq 100.$
• $1\leq L_i\leq 100.$