#include <iostream>
#pragma GCC optimise("O3, Ofast, unroll-loops")
using namespace std;

const int NMAX = 15;
int solution[NMAX], cnt = 0;
void print_solution(int n){
    for(int i = 1; i <= n; i++){
        printf("%d ", solution[i]);
    }
    printf("\n");
}
bool check_columns(int line, int column){
    for(int i = 1; i < line; i++)
        if(solution[i] == column) return false;
    return true;
}
bool check_diagonals(int line, int column){
    for(int i = 1; i < line; i++){
        if(abs(line - i) == abs(column - solution[i]))
            return false;
    }
    return true;
}
void backtrack(int line, int n){
    if(line == n + 1){
        if(cnt == 0)
            print_solution(n);
        cnt++;
        return;
    }
    for(int column = 1; column <= n; column++){
        if(!check_columns(line, column)) continue;
        if(!check_diagonals(line, column)) continue;
        solution[line] = column;
        backtrack(line + 1, n);
    }
}

int main(){
    freopen("damesah.in", "r", stdin);
    freopen("damesah.out", "w", stdout);
    int n;
    scanf("%d", &n);

    backtrack(1, n);
    printf("%d", cnt);
    return 0;
}