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 kth 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 kth number whose cube ends in 888. The result will be less than 263.

Example

Input:
1
1

Output:
192

Added by:Matthew Reeder
Date:2006-10-30
Time limit:1.197s
Source limit:30000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:Al-Khawarizm 2006

hide comments
2017-10-10 14:49:34
First gets WA
then just write 2 lines of code
and boom AC
2017-09-23 11:34:33
I would also say identify the pattern.
2017-08-30 18:33:00
AC in one go.........
2017-08-13 06:16:10
AC in 1st go.....
2017-08-12 18:33:51
Hint: Try finding arithmetic difference from the sequence.
Use unsigned long long in C++ for larger numbers.
2017-08-03 15:16:38
AC in a go bro..!
2017-07-27 14:01:10
There is a pattern :) Also very easy to see if You just print saveral such numbers.

Last edit: 2017-07-27 14:27:49
2017-07-05 09:31:02
Haha at first go ... TLE and then observed the pattern. So AC in 2nd go! but the real fascinating thing is why you are able to see pattern.....?
2017-06-28 16:26:45
AC in One go !
Quite easy if you observe the pattern by printing the first few such numbers.
4 lines of code in python , can be further shortened.

Last edit: 2017-06-28 16:27:58
2017-06-18 19:22:14
Any ideas how one can find the pattern easely without spoj toolkit? Thx to toolkit got AC
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.