#include <iostream>
#include <fstream>
#include <set>
#include <algorithm>
#include <limits.h>

#if 1
#define pv(x) cout<<#x<<" = "<<x<<"; ";cout.flush()
#define pn cout<<endl
#else
#define pv(x)
#define pn
#endif

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

using ll = long long;
using ull = unsigned long long;
using ui = unsigned int;
#define pb push_back
#define mp make_pair
const int NMax = 1e2 + 5;
const int inf = 1e9 + 5;
const int mod = 100003;
using zint = int;

int N,sol;
int queen[NMax];
bool col[NMax],row[NMax],prin[NMax],sec[NMax];

void backT(int);

int main() {
    in>>N;

    backT(1);

    out<<sol<<'\n';

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

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

        ++sol;
        return;
    }

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

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