Source

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

Problem 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 $\tt A$.
• Otherwise, the $i$-th sequence consists letters $\tt B$.

Print all the sequences after the operation.

Input Format

The first line consists of an integer $N\ (1 \le N \le 100)$.

Then $N$ lines follow.

The $i$-th line of them consists of an integer $L_i\ (1 \le L_i \le 100)$.

Output Format

Print all the sequences after the operation.

Samples

5
1
2
3
4
5

A
AA
BBB
BBBB
BBBBB