#t275. 886

886

Lucky Number 886

Problem Background

Special for beginners, ^_^

Problem Description

In decimal, a number is called a lucky number if it consists only of the digits 66 and 88. Sort all lucky numbers in increasing order: the first lucky number is 66, followed by 8,66,68,86,88,…8, 66, 68, 86, 88, \dots

Given nn, output the nn-th lucky number.

Input Format

A single integer: nn.

Output Format

A single integer: the nn-th lucky number.

Sample Input

7

Sample Output

666

Constraints

1s, 1024KiB for each test case.

30%30\% of the data: 1≤n≤5001 \le n \le 500

60%60\% of the data: 1≤n≤1,000,0001 \le n \le 1,000,000

100%100\% of the data: 1≤n≤1,000,000,000,000,0001 \le n \le 1,000,000,000,000,000