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

#include <bits/stdc++.h>
using namespace std;
const int M = 5000;
long long n;
long long arr[M];
long long re;
void lucky(long long x, long long y) {
  arr[n++] = x;
  if (y < 10) {
    lucky(x * 10 + 0, y + 1);
    lucky(x * 10 + 1, y + 1);
  }
}
int main() {
  lucky(0, 1);
  lucky(1, 1);
  sort(arr, arr + n);
  set<int> ad;
  for (int i = 0; i < n; i++) {
    ad.insert(arr[i]);
  }
  int nu;
  cin >> nu;
  if (nu <= 9) {
    cout << nu << endl;
    for (int i = 0; i < nu; i++) {
      cout << 1 << " ";
    }
    cout << endl;
    return 0;
  }
  vector<int> binario;
  for (set<int>::iterator i = ad.begin(); i != ad.end(); i++) {
    binario.push_back(*i);
  }
  bool oj = 0;
  int var = nu;
  vector<int> ans;
  while (nu > 9) {
    bool ok = 0;
    int maxi = -1;
    int mayor = -1;
    vector<int> vari;
    for (int i = 0; i < binario.size(); i++) {
      int dif = nu - binario[i];
      if (dif >= 0) {
        vari.push_back(dif);
        mayor = binario[i];
      }
    }
    for (int i = 0; i < vari.size(); i++) {
      for (int j = 1; j < binario.size(); j++) {
        if (vari[i] != 0 & vari[i] % binario[j] == 0) {
          maxi = max(maxi, binario[j]);
        }
      }
    }
    if (maxi != -1) {
      nu -= maxi;
      ans.push_back(maxi);
    } else {
      nu -= mayor;
      ans.push_back(mayor);
    }
  }
  cout << ans.size() + nu << endl;
  for (int i = 0; i < ans.size(); i++) {
    cout << ans[i] << " ";
  }
  for (int i = 0; i < nu; i++) {
    cout << 1 << " ";
  }
}
