#include <cstdio> #include <algorithm> int P; int A[10] = {0, 1, 2, 3, 4, 5, 6, 7, 8, 9}; // a b c d e f g h i int main() { scanf("%d", &P); int cnt = 0; do { if(A[1] + A[2] + A[4] + A[6] == P && A[6] + A[7] + A[8] + A[9] == P && A[9] + A[5] + A[3] + A[1] == P && A[1] < A[6] && A[6] < A[9] && A[2] < A[4] && A[7] < A[8] && A[3] < A[5]) cnt++; } while(std::next_permutation(A + 1, A + 10)); if(cnt > 0) printf("%d", cnt); else puts("Not exist"); return 0; }