#include <bits/stdc++.h>
using namespace std;
int a[15], n, s;
bool b[14], c[27], d[27];

void Search(int k) {
	if (k == n + 1) {
		if (n < 3) {
			for (int i = 1; i <= n; i++) {
				cout << a[i] << " ";
			}
			cout << endl;
		}
		n++;
	} else {
		for (int i = 1; i <= n; i++) {
			if (b[i] == 0 && c[i + k] == 0 && d[i - k + n] == 0) {
				a[k] = i;
				b[i] = 1;
				c[i + k] = 1;
				d[i - k + n] = 1;
				Search(k + 1);
				b[i] = 0;
				c[i + k] = 0;
				d[i - k + n] = 0;
			}
		}
	}
}

int main() {
	cin >> n;
	Search(1);
	cout << n;
	return 0;
}