#include <bits/stdc++.h>

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

const int NMAX = 15;

int stk[NMAX], n, ans;
bool okdiag1[2 * NMAX], okdiag2[2 * NMAX], okcol[NMAX];

void explore(int lin) {
    if(lin == n + 1) {
        if(ans == 0) {
            for(int i = 1; i <= n; i ++)
                out << stk[i] << " ";
            out << "\n";
        }
        ans ++;
    } else {
        for(int col = 1; col <= n; col ++) {
            if(okcol[col] == 0 && okdiag1[lin - col + n] == 0 && okdiag2[lin + col] == 0) {
                okcol[col] = okdiag1[lin - col + n] = okdiag2[lin + col] = 1;
                stk[lin] = col;

                explore(lin + 1);

                okcol[col] = okdiag1[lin - col + n] = okdiag2[lin + col] = 0;
            }

        }
    }
}

int main() {
    in >> n;
    explore(1);
    out << ans;
    return 0;
}