Token Distribution Challenge

You are given a positive integer representing the number of tokens. A group of 25 friends, identified as F01, F02, ... , F25, receive tokens in a cyclic order. The tokens are distributed one by one starting from friend F01 to friend F25 and then repeating in a loop. Your task is to determine the friend who receives the last token.

The computation can be modeled with the formula:

$$ friend\_id = ((T - 1) \mod 25) + 1 $$

where \(T\) is the total number of tokens. The answer should be formatted as a string with a leading zero if necessary (e.g., "F01", "F02", ..., "F25").

Input will be provided via standard input (stdin) and output should be printed to standard output (stdout).

inputFormat

The input begins with an integer \(N\) indicating the number of test cases. Each of the next \(N\) lines contains a single integer \(T\) (\(1 \leq T \leq 10^9\)) representing the total number of tokens in that test case.

outputFormat

For each test case, output the friend ID (in the format Fxx) who receives the last token. Each answer should be printed on a new line.

## sample

3
30
50
75

F05
F25
F25

</p>