D. Nice (Easy Version)
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

A number is nice if it contains only the digits $$$6$$$ and $$$9$$$. For example, $$$6$$$, $$$99$$$ and $$$69$$$ are nice numbers but $$$5$$$, $$$63$$$ and $$$169$$$ are not.

You are given an integer $$$n$$$. Find the smallest nice number that is greater than or equal to $$$n$$$.

Input

The first line contains an integer $$$t$$$ ($$$1 \le t \le 99$$$) — the number of test cases.

The only line contains an integer $$$n$$$ ($$$1 \le n \le 99$$$).

Output

For each test case, print the smallest nice number that is greater than or equal to $$$n$$$.

Example
Input
3
1
68
99
Output
6
69
99
Note

In the first test case, from $$$1$$$ to $$$5$$$, no number contains only digits $$$6$$$ and $$$9$$$. So, the smallest nice number greater than or equal to $$$1$$$ is $$$6$$$.

In the third test case, $$$99$$$ itself is nice, so $$$99$$$ is the answer.