#include <iostream>
#include <fstream>
#include <stack>
#include <vector>

using namespace std;
ifstream in("damesah.in");
ofstream out("damesah.out");

#define ll long long
#define pb push_back
const int inf = 1e9 + 5;
const int NMax = 15 + 5;

int N,nrSol;
int queen[NMax];
bool col[NMax],diagPrin[2*NMax],diagSec[2*NMax];

void backT(int);

int main() {
    in>>N;
    backT(1);

    out<<nrSol<<'\n';

    in.close();
    out.close();
    return 0;
}

void backT(int i) {
    if (i == N+1) {
        if (!nrSol) {
            for (int i=1;i <= N;++i) {
                out<<queen[i]<<' ';
            }
            out<<'\n';
        }

        ++nrSol;
        return;
    }

    for (int j=1;j <= N;++j) {
        if (col[j] || diagPrin[N + i - j] || diagSec[i + j]) {
            continue;
        }

        queen[i] = j;
        col[j] = diagPrin[N + i - j] = diagSec[i + j] = true;
        backT(i+1);
        col[j] = diagPrin[N + i - j] = diagSec[i + j] = false;
    }
}