#include <iostream>
#include <cmath>
using namespace std;

int n, x[101], nrsol = 0;

bool valid(int k)
{
    for(int i = 1; i < k; i++)
        if(x[k] == x[i] || k - i == abs(x[k] - x[i]))
            return 0;
    return 1;
}

void afis(){
    nrsol++;
    for(int i=1;i<=n;i++)
        cout<<x[i]<<' ';
    cout<<'\n';
}

void backt()
{
    int k = 1;
    x[1] = 0;
    while(k > 0)
        if(x[k] < n) ///mai avem elemente
        {
            x[k]++; ///...cautare
            if(valid(k)) ///se verifica conditiile de continuare (v.c.c.)
            {
                if(k == n) ///este solutie
                {
                    afis();
                    ///k--; ///se poate forta revenirea
                }
                else
                    x[++k] = 0; ///avansare + init
            }
        }
        else
            k--; ///revenire
}

int main()
{
    cout << "n?";
    cin >> n;
    backt();
    cout << "Numar solutii generate: " << nrsol << " soltii." << '\n';
    return 0;
}