#include <iostream>
#include <vector>
#include <algorithm>
#include <fstream>
using namespace std;
ifstream in("damesah.in");
ofstream out("damesah.out");
void solve(int n, int &nr, int y, vector<int> aleg, vector<int> amvazut, vector<int> diferente, vector<int> sume){
    if (y == n){
        nr += 1;
        if (nr == 1){
            for (int i = 0; i < n; i++)
                    out<< aleg[i] << " ";
            out<< "\n";
        }
    }
    else{
        for (int i = 1; i <= n; i++){
            bool ok = 0;

            aleg[y] = i;
            int sum = y + 1 + aleg[y], dif = y + 1 - aleg[y];
            if (dif < 0)
                dif = abs(dif) + 12;
            amvazut[aleg[y]]++;
            sume[sum] ++;
            diferente[dif] ++;
            if (amvazut[aleg[y]] <= 1 && sume[sum] <= 1 && diferente[dif] <= 1)
                solve(n, nr, y + 1, aleg, amvazut, diferente, sume);
            amvazut[aleg[y]] -= 1;
            sume[sum] --;
            diferente[dif] --;
        }
    }
}

int main()
{
    int n, y = 0, nr = 0;

    in>> n;
    vector<int> amvazut(n + 1, 0), aleg(n, 0), diferente(25, 0), sume(27, 0);

    solve(n, nr, y, aleg, amvazut, diferente, sume);
    out<< nr;
    return 0;
}