#include<bits/stdc++.h>
using namespace std;
const int N = 15;
bool c[N], zd[N], fzd[N];
int ans[N], n, cnt = 0;
void dfs(int step) {
    if(step == n+1) {
        cnt++;
        for(int i = 1; i <= n; i++) {
            cout << ans[i] << " ";
        }
        cout << '\n';
    }
    for(int j = 1; j <= n; j++) {
        int b1 = j-step + n;
        int b2 = j + step;
        if(!c[j] && !zd[b1] && !fzd[b2]){
        	c[j] = zd[b1] = fzd[b2] = true;
        	ans[step] = j;
        	dfs(step + 1);
        	c[j] = zd[b1] = fzd[b2] = false;
		}
    }
}
int main() {
    cin >> n;
	dfs(1);
	if(cnt == 0){
		cout << "no solute!";
	}
}

枪战

F1名场面