Shyam and Ram are good friends.Ram is very good at mathematics. So for securing some computer application Shyam needs to generate keys with atmost 'n' digit number which consists of only odd digits except 3 i.e.., 1,5,7,9. So Shyam asks his friend Ram to provide all possibilities so that he can pick what ever he likes. As you are a student of Ram , Ram assigns this works to you . Now it's your task to prove your ability. If Shyam provides you the number N you need to print all the possibilities with atmost N digits in increasing order of their value. To be clear If Shyam assigns you the number '4' you need to print all the possibilities of numbers with 1 digit, 2 digits , 3 digits and 4 digits where the numbers can only be formed with digits 1,5,7,9.

INPUT:

The input containly only number N.

OUTPUT:

The output should be all the possibilities of a number with atmost N digits formed by 1,5,7,9 and each number in a new line and in increasing order.

CONSTRAINTS:

1<=N<=8.