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
2018-02-19 05:13:28
if k == 1 then 192
else 192 + (k-1)*250
2018-01-23 13:41:18
Total time waste -_-
2018-01-17 14:41:30
its simple, number of the this form 10(19+25(k-1))+2. you can deduce this if you see the example carefully
2018-01-11 17:06:02
Use Spoj Toolkit thanks to @ajayc1007 and @prasad_235
2017-12-29 07:19:27
Nobody asks you to write AC in one go bitches..!!
Please dont spam here #admin
2017-12-22 22:50:24
Shut up, anybody wants know your solutions!

Last edit: 2017-12-22 22:50:51
2017-12-19 15:04:10
look for using AP(ARITHMATIC PROGRESSION) in the problem.
2017-12-18 14:16:39
AC in one go..........
2017-12-06 19:38:31
AC in one go
2017-11-14 07:37:16
1 line of code in python
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.