EIGHTS  Triple Fat Ladies
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.
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
emtiaz_001:
20190827 16:57:11
ac in first go. just use the formula and try to understand the concept 

tanuj_yadav_07:
20190608 11:17:47
use basic string multipplication and use AP formula Tn=192+(n1)*250 === or use it Tn=n*25058.


sjd:
20190519 08:27:53
Nice concept :) 

knir0103:
20190228 06:48:24
this blog not using formula: <snip> Last edit: 20220807 10:45:19 

aj_254:
20190224 12:32:32
ac in first go ..just read in comments 192+(k1)*250 and observer it ..and print it .happy coding. 

kushagra_2:
20190119 20:52:31
c++ users please use long long instead of int AC in 3rd attempt.


dhia01:
20181030 05:48:45
I hate spoiler but i love it :) 

phoemur:
20180905 02:33:30
C++14 one liner !!


amitnsky:
20180816 11:04:24
reason behind AP is that we need some number after adding that last three digits should not disturbed of 192^3.


bansalabhi_98:
20180627 09:00:44
@sreejoy4242 why separate case for k==1

Added by:  Matthew Reeder 
Date:  20061030 
Time limit:  1.197s 
Source limit:  30000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  AlKhawarizm 2006 