#include<bits/stdc++.h>
using namespace std;
int a[10010] = {1} , n , j = 0;
int k[5010][5010];
void dfs(int x , int rest){
    if(x == 11 and rest == 0){
    	j++;
    	for(int i = 1; i < x; i++){
    		k[j][i] = a[i];
		}
		return;
	}
	for(int i = 1; i <= rest; i++){
		a[x] = i;
		dfs(x + 1 , rest - i);
	}
}
int main(){
    cin >> n;
    dfs(1 , n);
    cout << j << endl;
    for(int o = 1; o <= j; o++){
    	for(int i = 1; i < 11; i++){
    		cout << k[o][i] << " ";
		}
		cout << endl;
	}
}