UVA 10858

#include <iostream>

#include <cmath>
#include <memory.h>
#include <algorithm>
#include <map>
#include <vector>
#include <cstdio>
#include <stack>
using namespace std;

int n;
vector<vector<int> >ans;
vector<int>stak;
void generate(int n,int divisor){
	int bound=sqrt((double)n)+0.5;
	for (int i=divisor;i<=bound;++i)
	{
		if(n%i==0){
			stak.push_back(i);
			generate(n/i,i);
			stak.pop_back();
		}
	}
	stak.push_back(n);
	ans.push_back(stak);
	stak.pop_back();
}
int main(){
	while (scanf("%d",&n)==1&&n)
	{
		ans.clear();
		int bound=sqrt((double)n)+0.5;
		
		generate(n,2);
		printf("%d\n",ans.size()-1);
		for (int i=0;i<ans.size()-1;++i)
		{
			for (int j=0;j<ans[i].size();++j)
			{
				printf("%d",ans[i][j]);
				if(j+1!=ans[i].size())printf(" ");
			}
			printf("\n");
		}
	}
	return 0;
}