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
ajax: 2012-06-23 15:19:23

can somebody help me my program is giving correct output for every cases but still i am getting WA on submission.
my submission id is : 7200486

Neel Lahiri: 2012-05-16 05:02:18

bring this back to the classical section..not a tutorial problem for sure

Last edit: 2012-05-16 05:02:33
Loving Primes Yummy :D :): 2012-05-13 10:47:17

Ultimate question... Loved doing that... :)

MR. BEAN : 2012-05-11 15:08:42

One more problem on same concept is
http://www.spoj.pl/problems/ITRIX_B/

strings: 2012-04-29 21:08:58

certainly not a tutorial problem...
nyc application of logic.. even look for range, it can b a problem!!

PubLic_AvenGeR: 2012-04-29 13:28:28

Good one :) ...Surely not a tutorial problem.

neerajcrespo: 2012-04-23 11:44:23

Nice problem. :)

Laplace: 2012-04-21 20:23:15

It's nice problem .....

! include(L.ppt): 2012-04-21 15:19:15

@ noju agreed....


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