Decode Small Numeric Codes

Source: Phước Hưng OJ

Version: Phuoc Hung OJ Extended

Problem Statement

A system records $n$ integer codes. Each code is between $0$ and $3$ and represents one English word: $0$ means ZERO, $1$ means ONE, $2$ means TWO, and $3$ means THREE. Decode the codes in their original order. If $n=0$, produce no output lines.

Input

The first line contains the integer $n$. If $n>0$, the remaining input contains exactly $n$ integers $c_1,c_2,\ldots,c_n$, separated by spaces or newlines.

Output

For each code, print its corresponding English word on a separate line, in the same order; print nothing if $n=0$.

Subtasks

• Subtask 1 (20%): $0\le n\le20,\ c_i\in\{0,1\}$.
• Subtask 2 (30%): $0\le n\le1000,\ c_i\in\{0,1,2,3\}$.
• Subtask 3 (50%): $0\le n\le10^5,\ c_i\in\{0,1,2,3\}$.

Examples

Example 1

Input:

4
0 3 1 2

Output:

ZERO
THREE
ONE
TWO

Explanation: The codes $0$, $3$, $1$, and $2$ map to ZERO, THREE, ONE, and TWO, respectively. Print these on four lines in input order.

Example 2

Input:

3
2 2 2

Output:

TWO
TWO
TWO

Explanation: All three codes are $2$, so TWO is printed three times. Repeated codes are not removed.

Example 3

Input:

0

Output:

Explanation: There are zero codes, so the loop runs zero times and prints nothing.