## Problem code: EIGHTS

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 1st number larger than k 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 ≤ 20000).

### Output

For each test case, output a single integer which denotes the 1st number larger than k whose cube ends in 888. The result will be less than 263.

### Example

```Input:
1
1

Output:
192
```

Point Value: 5
Time Limit: 2.00s
Memory Limit: 16M

Languages Allowed:
C++03, PAS, C, HASK, ASM, RUBY, PYTH2, JAVA, PHP, SCM, CAML, PERL, C#, C++11, PYTH3

<
1
2
>

• (1/1)
Any hints on what I'm doing wrong?

• (0/0)
overflow

• (2/5)
What is wrong with my code
It works in eclipse

• (4/1)
 help Mr. HKP find the 1st number larger than k whose cube ends in 888.

• (1/0)
i figured the algorithm which was simple but i still get mistakes

• (2/1)
Your algorithm is wrong; try writing a program that will run from 1 to 5000 and output every integer n where n3 = 888 (mod 1000). You'll then see what you're missing.

• (0/0)

• (0/0)
Is every string bigger than length(3)?

• (0/2)
Solutions have been rejudged. (admin now fails...)