TSHOW1 - Amusing numbers

Amusing numbers are numbers consisting only of digits 5 and 6. Given an integer k , display the k-th amusing number.

Input

FIrst line consists of integer N representing number of test cases

Next N lines consist of N integers (1 <= k <= 10^15)

Output

N lines each displaying corresponding k-th amusing number

Example

Input:
2
1
5

Output:
5
65

Added by:Pandian
Date:2012-04-10
Time limit:1s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All
Resource:AOL code contest

hide comments
2015-05-24 16:16:50 NEXES
good one!!!!!!!
2015-05-23 06:19:48 Satyam Mishra
what a problem !!!
Amused after solving amusing numbers. :D
2015-04-03 08:36:19 Dhruv k14
manku word !!! :)
2015-03-29 09:12:03 kailash
good problem
2015-03-20 08:55:12 [Mayank Pratap]
Loved this...After this solve MAY99_2...Loving Spoj...
2015-03-01 07:31:18 swordfish12
awesome fun solving this :)
2015-02-21 06:35:59 Arnabjyoti Kalita
Nice...
2015-01-29 11:56:19 Vikrant Singh
enjoyed solving this !!
2014-12-22 18:56:33 Arpit Gupta
nice question...:)
2014-11-06 13:09:15 Sahil Dua
3rd best timing in PYTH2.7 | 0.04s AC

Similar to MAY99_2. Just a couple of changes
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.