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
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 :)
2014-06-19 20:47:42 Soma
really amazing...../
2014-04-11 21:10:09 Gaurav Agrawal
can any1 explain the problem ?
2014-03-03 10:25:01 Piyush Nirmal
nice one...loved solving it.
2013-11-10 14:28:54 harsh
fresh one..:)
2013-08-23 17:41:35 P_Quantum
Easy one..!! same as MAY99_2.. :)
2013-08-13 19:52:36 @Shish
Yeahh..green in 1st attempt
2013-08-11 16:42:50 hiddenman
same as MAY99_2....:)
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.