Description

Senior J is a renowned cryptography master in the Kingdom of Trees.

The annual programming competition in the Kingdom of Trees is about to begin, and Prime Minister S has entrusted Senior J with the important task of maintaining the competition system. Senior J generated accounts and passwords for $n$ participating teams using $\tt{uuid4().hex}$ to create hexadecimal strings as passwords (containing only the digits $\tt{0-9}$ and $\tt{a-f}$), but he felt that the strength of the passwords generated this way was somewhat insufficient. Therefore, he switched to randomly generating byte sequences and using $\tt{base64}$ encoding to create more complex, high-strength passwords (containing lowercase letters, uppercase letters, numbers, underscores $\tt{\_}$, and hyphens $\tt{-}$).

However, during the warm-up match, many contestants frequently entered incorrect passwords due to difficulty distinguishing the characters $\tt{1}$, $\tt{i}$, $\tt{I}$, and $\tt{l}$, making it impossible for them to log into the system smoothly. Prime Minister S was very angry about this and demanded that Senior J immediately rectify the passwords for the official competition by removing all easily confused characters. Senior J now wants to know how to modify the passwords for the official competition.

Specifically, given the original password for each team during the official competition login, you need to remove all occurrences of $\tt{1}$ (the digit 1), $\tt{i}$ (the lowercase letter i), $\tt{I}$ (the uppercase letter i), and $\tt{l}$ (the lowercase letter L) from the original password and output the modified password.

Input Format

The first line of input contains a positive integer $n$ ($1 \leq n \leq 5 \times 10^4$), indicating that there are $n$ teams participating in the competition.

The next $n$ lines each contain a non-empty string $s_i$ (the length of the string $|s_i|$ satisfies $1 \leq |s_i| \leq 5 \times 10^4$; input characters consist only of lowercase letters, uppercase letters, numbers, underscores $\tt{\_}$, and hyphens $\tt{-}$), representing the original password for each participating team's login to the system.

It is guaranteed that the sum of the lengths of the original passwords for the $n$ teams does not exceed $5 \times 10^4$.

Output Format

Output a total of $n$ lines, where the $i$-th line represents the password of the $i$-th team after removing $\tt{1iIl}$. If the password is empty, output $\textbf{empty string}$.

5
mCj_m3sYshA
1liil1ili
Itboe1Vcig4
lsj5lFx1Nrs
-j1ioFlIiI4

mCj_m3sYshA

tboeVcg4
sj5FxNrs
-joF4

6
Ave_mujica
Doloris
Mortis
Timoris
Amoris
Oblivionis

Ave_mujca
Doors
Morts
Tmors
Amors
Obvons