#include<math.h>
#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<algorithm>
#define LL long long
#define FORa(i,s,e) for(LL i=s;i<=e;i++)
#define FORs(i,s,e) for(LL i=s;i>=e;i--)
#define gc pa==pb&&(pb=(pa=buf)+fread(buf,1,10000,stdin),pa==pb)?EOF:*pa++
#define File(name) freopen(name".in","r",stdin),freopen(name".out","w",stdout)

using namespace std;
static char buf[10000],*pa=buf,*pb=buf;
inline LL read();

LL n,cnt,ct;
struct Node{
    string s;
    int a1;
}s[50000];
string Turn_s(int x)
{
    string fs;
    fs.clear();
    while(x)
    {
        fs=char((x%10)+‘0‘)+fs;
        x/=10;
    }
    return fs;
}
bool cmp(Node a,Node b)
{
    return a.a1<b.a1;
}
int main()
{
    File("num");
    n=read();
    cnt=-1+ceil(sqrt(4+8*n)/2);
    FORa(i,2,cnt)
    {
        if((2*n+i-i*i)%(2*i)==0)
        {
            LL a1=(2*n+i-i*i)/(2*i);
            s[++ct].s=Turn_s(a1),s[ct].a1=a1;
            FORa(j,2,i)
                s[ct].s=s[ct].s+" "+Turn_s(a1+j-1);
        }
    }
    sort(s+1,s+1+ct,cmp);
    if(ct==0) printf("NONE");
    else FORa(i,1,ct) cout<<s[i].s<<endl;
    return 0;
}
inline LL read()
{
    register LL x(0);register LL f(1);register char c(gc);
    while(c<‘0‘||c>‘9‘) f=c==‘-‘?-1:1,c=gc;
    while(c>=‘0‘&&c<=‘9‘) x=(x<<1)+(x<<3)+(c^48),c=gc;
    return x*f;
}