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

The first line consists of integer N representing number of test cases.

Next N lines consist of N integers (1 ≤ k ≤ 1015).

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-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
2014-11-02 10:09:29 CHANDAN KUMAR
piyush here digit can contain only 5 and 6 and you have to make no using 5 and in sorted order for example first no is 5 second is 6 then 55 56 65 and so on and here rank of 65 is 5 so 65 will be printed in case of 5
2014-07-04 20:23:29 Mansi Mittal
Awesome... Food for the Brain!!!
2014-06-23 08:44:14 Aragon!!!
one of the best ques here.. loved solving this :)
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.