#include <bits/stdc++.h>
using namespace std;
int f[13], cnt;
vector <int> v;
bool a = false;

int factorise(int n)
{
    if (n == 1 || n == 0)return 1;
    else return n * factorise(n-1);
}

int main()
{
    int n;
    cin >> n;
    int og = n;
    for (int i = 0; i < 13; i++)
    {
        f[i] = factorise(i+1);
    }
    for (int i = 12; n != 0; i--)
    {
        cnt = 0;
        while (f[i] <= n)
        {
            n -= f[i];
            cnt ++;
        }
        v.push_back(cnt);
    }
    for (auto it = v.begin(); it < v.end(); it++)
    {
        if(a == false && *it == 0){
            v.erase(it);
            it--;
        }
        else if (*it != 0)a = true;
    }
    reverse(v.begin(), v.end());
    cout << v.size() << '\n';
    for (auto it : v)
    {
        cout << it << ' ';
    }
}