poj2100

#include <iostream>
#include<cstdio>
#include<algorithm>

using namespace std;
typedef unsigned long long ll;
ll n,a[10000000][2];
int main()
{
    while(scanf("%lld",&n)!=EOF)
    {
        ll r=1,l=1,sum=0,k=0;
        while(1)
        {
            if((r-1)*(r-1)>n)
                break;
            if(sum<n)
            {
                sum+=r*r;
                r++;
            }
            else
            {
                if(sum==n)
                {
                    a[k][0]=l;
                    a[k][1]=r;
                    k++;
                }
                sum-=l*l;
                l++;
            }
        }
        printf("%lld\n",k);
        for(ll i=0;i<k;i++)
        {
            printf("%lld",a[i][1]-a[i][0]);
            for(ll j=a[i][0];j<a[i][1];j++)
                printf(" %lld",j);
            printf("\n");
        }
    }
    return 0;
}