Smallest Golden Number

You are given an integer k. A Golden number is a number whose decimal representation consists solely of the digits 1 and 0. In this problem, the Golden number must contain exactly k ones and no zeroes in between. In other words, the smallest Golden number with exactly k ones is:

$\underbrace{11\ldots1}_{k\text{ times}}$

Your task is to read an integer k from standard input and output the smallest Golden number that contains exactly k ones.

inputFormat

The input consists of a single line containing one integer k (1 ≤ k).

outputFormat

Output a single line, which is the smallest Golden number consisting of exactly k ones.## sample

1

1