CF BUDDY
← Problems·

1811E · Living Sequence

1500 · binary search, dp, math

Problem: In Japan, the number 44 reads like death, so Bob decided to build a live sequence. Living sequence aa contains all natural numbers that do not contain the digit 44. a=[1,2,3,5,6,7,8,9,10,11,12,13,15,16,]a = [1, 2, 3, 5, 6, 7, 8, 9, 10, 11, 12, 13, 15, 16, \ldots].

For example, the number 12351235 is part of the sequence aa, but the numbers 43214321, 443443 are not part of the sequence aa.

Bob realized that he does not know how to quickly search for a particular number by the position kk in the sequence, so he asks for your help.

For example, if Bob wants to find the number at position k=4k = 4 (indexing from 11), you need to answer ak=5a_k = 5.

Input Format: The first line of input data contains a single integer tt (1t1041 \le t \le 10^4) — the number of test cases.

In the only line of each test case, there is a single integer kk (1k10121 \le k \le 10^{12}) — the position Bob is interested in.

Output Format: For each test case, print on a separate line the number aka_k in indexing with 11.

Sample Cases

Case 1

Input

7
3
5
22
10
100
12345
827264634912

Output

3
6
25
11
121
18937
2932285320890

Similar problems

00:00:00
Loading editor…
Welcome! I'm your coding tutor for this problem. Use the chips below to reveal stored hints or get AI feedback on your code. I'll guide you step by step — never giving away the solution.

Sign in to unlock AI tutor feedback