/*#include <bits/stdc++.h>
typedef unsigned long long ul;
typedef long long ll;
using namespace std;

int n, tab[20], sol = 0;

ifstream in("damesah.in");
ofstream out("damesah.out");

void afisare(int k)
{
    for (int i = 1; i <= n; i++)
    {
        out << tab[i] << " ";
    }
    out << "\n";
}

bool solutie(int k)
{
    if (k == n) return 1;
    return 0;
}

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

void dame(int k)
{
    for (int i = 1; i <= n; i++)
    {
        tab[k] = i;
        if (valid(k))
        {
            if (solutie(k)) {
                if (sol == 0) afisare(k);
                sol++;
            }
            else dame(k + 1);
        }
    }
}

int main(){
//ios_base::sync_with_stdio(0); cin.tie(); cout.tie();

in >> n;

dame(1);

out << sol;
return 0;
}
*/

#include <iostream>
#include <math.h>
#include<fstream>
using namespace std;


int x[13];
int solutie[13];



void tiparesteSolutie(int n) {
	for (int i = 1; i <= n; i++) {
		solutie[i] = x[i];
	}
}

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

int backtrack(int n){
	int eSolutie, k;
	k = 1;
	x[k] = 0;
	int nrSolutii = 0;
	int prima = 1;
	while (k > 0) {
		eSolutie = 0;
		while ((x[k] < n) && (!eSolutie)) {
			x[k]++;
			eSolutie = eValid(k);
		}
		if (!eSolutie){
			k--;
		}
		else{
			if (k == n) {
				if (prima)
				{
					tiparesteSolutie(n);
					prima = 0;
				}
				nrSolutii++;
			}
			else {
				k++;
				x[k] = 0;
			}
		}
	}
	return nrSolutii;
}

int main() {
	ofstream o("damesah.out");
	ifstream f("damesah.in");
	int n, k, eSolutie;
	f >> n;
	int nrSolutii = backtrack(n);
	for (int i = 1; i <= n; i++){
		o << solutie[i] << " ";
	}
	o << '\n';
	o << nrSolutii;
	return 0;
}