TSHOW1  Amusing numbers
Amusing numbers are numbers consisting only of digits 5 and 6. Given an integer k , display the kth 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 kth amusing number
Example
Input: 2 1 5 Output: 5 65
hide comments
karan_yadav:
20180629 17:56:24
Hints


sonorous:
20170929 07:52:52
AC in one go!!! Very good question! 

vi1:
20170716 13:15:39
Easy, but fun :) 

epsilonalpha:
20170612 13:10:25
Stupid mistake in first submission, AC in second go using bits.


nilabja16180:
20170320 09:23:23
AC in one GO! 0.00 sec, bit manipulation is the key! 

vunnamtej:
20170309 15:47:19
little math 

up79:
20170301 15:43:57
new concept :) yipee AC in one go :) 

vanvinhbk94:
20170223 15:40:00
AC in one go :)) 

sudeep_11:
20170124 15:18:02
AC in one go ! easy one if you get the logic !


herkeyrefugee:
20170105 15:49:13
be careful with the input all inputs are taken before the outputting the answer to previous cases 
Added by:  Pandian 
Date:  20120410 
Time limit:  0.357s0.714s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All 
Resource:  AOL code contest 