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

hide comments
CHANDAN KUMAR: 2014-11-02 10:09:29

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

Mansi Mittal: 2014-07-04 20:23:29

Awesome... Food for the Brain!!!

Aragon!!!: 2014-06-23 08:44:14

one of the best ques here.. loved solving this :)

Soma: 2014-06-19 20:47:42

really amazing...../

Gaurav Agrawal: 2014-04-11 21:10:09

can any1 explain the problem ?

Piyush Nirmal: 2014-03-03 10:25:01

nice one...loved solving it.

harsh: 2013-11-10 14:28:54

fresh one..:)

P_Quantum: 2013-08-23 17:41:35

Easy one..!! same as MAY99_2.. :)

@Shish: 2013-08-13 19:52:36

Yeahh..green in 1st attempt

hiddenman: 2013-08-11 16:42:50

same as MAY99_2....:)


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