STROOQ  A complex yet very simple problem
Pattern Matchers have been designed for various sorts of patterns. Mr. HKP likes to observe patterns in numbers. After completing his extensive research on the squares of numbers, he has moved on to cubes. Now he wants to know all numbers whose cube ends in 888.
Given a number k, help Mr. HKP find the k^{th} number (indexed from 1) whose cube ends in 888.
Input
The first line of the input contains an integer t, the number of test cases. t test cases follow.(1<=t<=100000)
Each test case consists of a single line containing a single integer k (1 <= k <= 2000000000000).
Output
For each test case, output a single integer which denotes the k^{th} number whose cube ends in 888. The result will be less than 2^{63}.
Example
Input: 1
1
Output: 192
hide comments
hwb_worwa:
20180607 21:08:02
Same problem description as Eights in classic. 

nadstratosfer:
20180124 01:17:26
How did you get past it wisfaq? I get RE even if split the entire stdin and try taking next integer in try/except block. 

wisfaq:
20180122 21:39:50
There seems to be something wrong with the testfiles. 
Added by:  Sarwar 
Date:  20170518 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 