111111
 100009
 10011
 1000000
 8
 10201
 102030
 908172
 123456
 415
 900000
 21
 909090
 314159
 999999
 909823
 987654
 1453
 1435
 98
 10
 2
 1

1
111111
 9
100001 1 1 1 1 1 1 1 1
 1
10011
 1
1000000
 8
1 1 1 1 1 1 1 1
 2
10101 100
 3
101010 1010 10
 9
101111 101011 101010 101010 101010 101010 101010 101000 100000
 6
111111 11111 1111 111 11 1
 5
111 101 101 101 1
 9
100000 100000 100000 100000 100000 100000 100000 100000 100000
 2
11 10
 9
101010 101010 101010 101010 101010 101010 101010 101010 101010
 9
111111 101011 101011 1011 11 1 1 1 1
 9
111111 111111 111111 111111 111111 111111 111111 111111 111111
 9
101111 101111 101101 101100 101100 101100 101100 101100 101000
 9
111111 111111 111111 111111 111110 111100 111000 110000 100000
 5
1111 111 111 110 10
 5
1111 111 111 101 1
 9
11 11 11 11 11 11 11 11 10
 1
10
 2
1 1
 1
1

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.ArrayList;


/**
 * http://codeforces.com/problemset/problem/538/B
 */
public class Main {

    static boolean isQuasi(int n) {
        while(n > 0) {
            int ld = n % 10;
            if (ld != 0 && ld != 1) {
                return false;
            }
            n /= 10;
        }
        if (n != 0 && n != 1) {
            return false;
        }
        return true;
    }

    public static void main(String[] args) throws Exception {

        BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
        int n = Integer.parseInt(in.readLine());
        ArrayList<Integer> quasi = new ArrayList<Integer>();
        for (int i = 1; i <= n ; i++) {
            if(isQuasi(i)) {
                //System.out.println(i);
                quasi.add(i);
            }
        }

        StringBuilder result = new StringBuilder();
        while (n >= 10) {
            int best = 0;
            for (int i = 0; i < quasi.size(); i++) {
                if (quasi.get(i) <= n) {
                    best = i;
                } else {
                    break;
                }
            }
            int d = n / quasi.get(best);
            int r = n % quasi.get(best);
            for (int j = 0; j < d; j++) {
                result.append(String.valueOf(quasi.get(best)) + " ");
            }
            n = r;
        }

        for (int i = 0; i < n; i++) {
            result.append(String.valueOf("1") + " ");
        }

        System.out.println(result.toString().trim());

    }

}
