ztr loves lucky numbers

Time Limit: 1000ms
Memory Limit: 65536KB
This problem will be judged on HDU. Original ID: 5676
64-bit integer IO format: %I64d      Java class name: Main

Description

ztr loves lucky numbers. Everybody knows that positive integers are lucky if their decimal representation doesn't contain digits other than 4 and 7. For example, numbers 47, 744, 4 are lucky and 5, 17, 467 are not.

Lucky number is super lucky if it's decimal representation contains equal amount of digits 4 and 7. For example, numbers 47, 7744, 474477 are super lucky and 4, 744, 467 are not.

One day ztr came across a positive integer n. Help him to find the least super lucky number which is not less than n.

Input

There are T$(1\leq\;n\leq\;10^{5})$ cases

For each cases:

The only line contains a positive integer $n(1\leq\;n\leq\;10^{18})$. This number doesn't have leading zeroes.

Output

For each cases
Output the answer

Sample Input

2
4500
47

Sample Output

4747
47

Source

Language: 
Theme: 
Share Code? 

Powered by NB231 | Current Style: .