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
vikash:
20191015 12:15:11
Submitted the same solution in Java and scala.


nitin_uniyal21:
20190713 06:50:53
I did it using binary tree..


tanav_shah1:
20190515 00:03:26
Excellent question, brilliant concept ! 

raftar2097:
20181030 08:28:27
nice go


salman3007:
20181027 20:04:38
think binary!!! 

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! 
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 