#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>
#include <fstream>
#include <iterator>
#include <assert.h>
#include <unordered_map>
using namespace std;
 
 
const string file = "damesah";
 
const string infile = file + ".in";
const string outfile = file + ".out";
 
const int INF = 0x3f3f3f3f;
 
short N;
vector<bool> uz;
vector<short> X;

int Sols;
vector<short> Sol;

bool valid(short k)
{
	for(int i = 0; i < k; i++)
	{
		if(abs(i - k) == abs(X[i] - X[k]))
			return false;
	}
	return true;
}

void bkt(short k)
{
	if(k == N)
	{
		if(Sols == 0)
		{
			Sol = X;
		}
		Sols++;
	}
	else
	{
		for(short i = 1; i <= N; i++)
		{
			if(uz[i] == false)
			{
				X[k] = i;
				if(valid(k) == false)
					continue;
				uz[i] = true;
				bkt(k + 1);
				uz[i] = false;
			}
		}
	}
}




int main()
{
#ifdef ONLINE_JUDGE
    ostream &fout = cout;
    istream &fin = cin;
#else
    fstream fout(outfile.c_str(), ios::out);
    fstream fin(infile.c_str(), ios::in);
#endif  

	
	fin >> N;
	uz.resize(N + 1);
	X.resize(N);
	bkt(0);


	for(int i = 0; i < N; i++)
	{
		fout << Sol[i] << " ";
	}
	fout << "\n";
	fout << Sols << "\n";

 
#ifdef ONLINE_JUDGE
#else
 
    fin.close();
    fout.close();
#endif
}