#include<bits/stdc++.h>

using namespace std;

#define ll long long

int n;

set<ll> ans;

void dfs(int i,int c,int res,ll sum){

    res-=c;

    sum=sum*+c;

    if(res<)

        return;

    if((-i)>res||(-i)*<res)

        return;

    if(i==){

        if(res!=)

            return;

        else{

            ans.insert(sum);

        }

    }

    else{

        dfs(i+,,res,sum);

        dfs(i+,,res,sum);

        dfs(i+,,res,sum);

    }

}

int main(){

    scanf("%d",&n);

    dfs(,,n,);

    dfs(,,n,);

    dfs(,,n,);

    printf("%d\n",ans.size());

    for(auto i:ans){

        //cout<<i<<endl;;

        ll t=i;

        stack<int> s;

        while(t){

            s.push(t%);

            t/=;

        }

        while(!s.empty()){

            printf("%d",s.top());

            s.pop();

            if(s.empty())

                printf("\n");

            else

                printf(" ");

        }

    }

}