#include <cstdio>
#include <algorithm>
using namespace std;
short n,sol,a[14];
void init(short k)
{
    a[k]=0;
}
short succ(short k)
{
    if(k<=n && a[k]<n)
    {
        a[k]++;
        return 1;
    }
    return 0;
}
short valid(short k)
{
    short i;
    for(i=1;i<=k-1;i++)
        if(a[i]==a[k])
            return 0;
    for(i=1;i<=k-1;i++)
        if(abs(i-k)==abs(a[i]-a[k]))
            return 0;
    return 1;
}
short solutie(short k)
{
    if(k==n)
        return 1;
    return 0;
}
void afis(short k)
{
    short i;
    for(i=1;i<=k;i++)
        printf("%hd ",a[i]);
    printf("\n");
}
void back()
{
    short i,k;
    k=1;
    while(k)
    {
        i=0;
        while(!i && succ(k))
            if(valid(k))
                i=1;
        if(!i)
            k--;
        else
            if(solutie(k))
            {
                sol++;
                if(sol==1)
                    afis(k);
            }
            else
            {
                k++;
                init(k);
            }
    }
}
int main()
{
    freopen("damesah.in","r",stdin);
    freopen("damesah.out","w",stdout);
    scanf("%hd",&n);
    sol=0;
    back();
    printf("%hd\n",sol);
    return 0;
}