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

hide comments
Code Geass: 2013-05-26 13:13:03

very nice problem... :) .. finally AC after so many mistakes.. :P

apsdehal: 2013-03-31 08:40:43

After this try similar but higher level version of this: MAY99_2

tress: 2013-01-11 12:30:30

Nice question..

gourav: 2012-12-20 08:33:29

good problem... binary numbers problem....


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