#include<bits/stdc++.h>
using namespace std;
int vis[3][10];
void search(int cur)
{
if (cur == n)
{
totall++;
}
else
{
for (int i = 0; i < n; i++)
{
if (!vis[0][i] && !vis[1][cur + i] && !vis[2][cur - i + n])
c[cur] = i;
vis[0][i] = vis[1][cur + i] = vis[2][cur - i + n] = 1;
search(cur + 1);
vis[0][i] = vis[1][cur + i] = vis[2][cur - i + n] = 0;
}
}
}
int main()
{
return 0;
}