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
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....:)
2013-07-16 02:51:33 Rishabh Dugar
nice branie problem..amazing constraints
2013-06-29 19:45:56 pika_pika
i had a strange problem.I solved MAY99_2 before this problem and got AC in python the first attempt.But now in C++ i had a lot of WA. I just ported the prev problem to this and again AC in 1st attempt.
© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.