#include <iostream>
#include <algorithm>
using namespace std;
int queens (){
int pos[] = {0,1,2,3,4,5,6,7},ans = 0;
while(next_permutation(pos,pos+8)){
bool ok = true;
for(int* p = pos;p<pos+8;p++)
if ( count_if(pos,p,[=](int& j){return p - &j == *p-j || p - &j == j - *p ;}) )
ok = false;
ans += ok;
}
return ans;
}
int main() {
cout<<queens();
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKaW50IHF1ZWVucyAoKXsKCWludCBwb3NbXSA9IHswLDEsMiwzLDQsNSw2LDd9LGFucyA9IDA7Cgl3aGlsZShuZXh0X3Blcm11dGF0aW9uKHBvcyxwb3MrOCkpewoJCWJvb2wgb2sgPSB0cnVlOwoJCWZvcihpbnQqIHAgPSBwb3M7cDxwb3MrODtwKyspCgkJCWlmICggY291bnRfaWYocG9zLHAsWz1dKGludCYgail7cmV0dXJuIHAgLSAmaiA9PSAqcC1qIHx8IHAgLSAmaiA9PSBqIC0gKnAgO30pICkgCgkJCQlvayA9IGZhbHNlOwoJCWFucyArPSBvazsKCX0KCXJldHVybiBhbnM7Cn0KaW50IG1haW4oKSB7Cgljb3V0PDxxdWVlbnMoKTsKCXJldHVybiAwOwp9