#line 2 "/Users/kaage/Desktop/ProgrammingWorkspace/library/other/template.hpp" #define _CRT_SECURE_NO_WARNINGS #ifndef __clang__ #ifdef ONLINE_JUDGE #pragma GCC target("avx512f") #elif defined EVAL #else #pragma GCC target("avx2") #endif #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") #endif #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define rep(i, n) for (int i = 0; i < int(n); i++) #define REP(i, n) for (int i = 1; i <= int(n); i++) #define all(V) V.begin(), V.end() using i128 = __int128_t; using u128 = __uint128_t; using uint = unsigned int; using lint = long long; using ulint = unsigned long long; using IP = std::pair; using LP = std::pair; constexpr int INF = INT_MAX / 2; constexpr lint LINF = LLONG_MAX / 2; constexpr double eps = DBL_EPSILON; constexpr double PI = 3.141592653589793238462643383279; template class prique : public std::priority_queue, std::greater> { }; int popcount(uint x) { #if __cplusplus >= 202002L return std::popcount(x); #else #ifndef __clang__ return __builtin_popcount(x); #endif #endif x = (x & 0x55555555) + (x >> 1 & 0x55555555); x = (x & 0x33333333) + (x >> 2 & 0x33333333); x = (x & 0x0f0f0f0f) + (x >> 4 & 0x0f0f0f0f); x = (x & 0x00ff00ff) + (x >> 8 & 0x00ff00ff); return (x & 0x0000ffff) + (x >> 16 & 0x0000ffff); } template inline constexpr decltype(auto) lambda_fix(F&& f) { return [f = std::forward(f)](auto&&... args) { return f(f, std::forward(args)...); }; } template constexpr std::vector make_vec(size_t n) { return std::vector(n); } template constexpr auto make_vec(size_t n, Args&&... args) { return std::vector(args...))>( n, make_vec(std::forward(args)...)); } template std::istream& operator>>(std::istream& ist, std::pair& x) { return ist >> x.first >> x.second; } template std::ostream& operator<<(std::ostream& ost, const std::pair& x) { return ost << x.first << " " << x.second; } template constexpr inline bool chmax(T& lhs, const U& rhs) noexcept { if (lhs < rhs) { lhs = rhs; return true; } return false; } template constexpr inline bool chmin(T& lhs, const U& rhs) noexcept { if (lhs > rhs) { lhs = rhs; return true; } return false; } constexpr inline lint gcd(lint a, lint b) noexcept { while (b) { lint c = a; a = b; b = c % b; } return a; } inline lint lcm(lint a, lint b) noexcept { return a / gcd(a, b) * b; } constexpr bool isprime(lint n) noexcept { if (n == 1) return false; for (int i = 2; i * i <= n; i++) { if (n % i == 0) return false; } return true; } template constexpr T mypow(T a, lint b) noexcept { T res(1); while (true) { if (b & 1) res *= a; b >>= 1; if (!b) break; a *= a; } return res; } constexpr lint modpow(lint a, lint b, lint m) noexcept { a %= m; lint res(1); while (b) { if (b & 1) { res *= a; res %= m; } a *= a; a %= m; b >>= 1; } return res; } template constexpr void printArray(const std::vector& vec, char split = ' ') { rep(i, vec.size()) { std::cout << vec[i]; std::cout << (i == (int)vec.size() - 1 ? '\n' : split); } } template constexpr void printArray(InputIter l, InputIter r, char split = ' ') { auto rprev = std::prev(r); for (auto i = l; i != r; i++) { std::cout << *i; std::cout << (i == rprev ? '\n' : split); } } LP extGcd(lint a, lint b) noexcept { if (b == 0) return {1, 0}; LP s = extGcd(b, a % b); std::swap(s.first, s.second); s.second -= a / b * s.first; return s; } LP ChineseRem(const lint& b1, const lint& m1, const lint& b2, const lint& m2) noexcept { auto p = extGcd(m1, m2); lint g = gcd(m1, m2), l = m1 / g * m2; lint tmp = (b2 - b1) / g * p.first % (m2 / g); lint r = (b1 + m1 * tmp + l) % l; return {r, l}; } int LCS(const std::string& a, const std::string& b) { auto dp = make_vec(a.size() + 1, b.size() + 1); rep(i, a.size()) { rep(j, b.size()) { chmax(dp[i + 1][j], dp[i][j]); chmax(dp[i][j + 1], dp[i][j]); if (a[i] == b[j]) chmax(dp[i + 1][j + 1], dp[i][j] + 1); } chmax(dp[i + 1][b.size()], dp[i][b.size()]); } rep(j, b.size()) chmax(dp[a.size()][j + 1], dp[a.size()][j]); return dp[a.size()][b.size()]; } template ::value, std::nullptr_t> = nullptr> void compress(std::vector& vec) { auto tmp = vec; std::sort(all(tmp)); tmp.erase(std::unique(all(tmp)), tmp.end()); for (T& i : vec) i = std::lower_bound(all(tmp), i) - tmp.begin(); } template void compress(T* l, T* r) { std::vector tmp(l, r); std::sort(all(tmp)); tmp.erase(std::unique(all(tmp)), tmp.end()); for (auto i = l; i < r; i++) { *i = std::lower_bound(all(tmp), *i) - tmp.begin(); } } template void compress(InputIter l, InputIter r) { std::vector tmp(l, r); std::sort(all(tmp)); tmp.erase(std::unique(all(tmp)), tmp.end()); for (auto i = l; i < r; i++) { *i = std::lower_bound(all(tmp), *i) - tmp.begin(); } } #line 2 "main.cpp" lint dp[1 << 16][217]; int diff[1 << 16]; bool mask[4][4]; int main() { int K; std::cin >> K; rep(i, 1 << 16) { rep(j, 16) mask[j >> 2][j & 3] = i & (1 << j); if (mask[0][0] != mask[0][1]) diff[i]++; if (mask[0][1] != mask[0][2]) diff[i]++; if (mask[0][2] != mask[0][3]) diff[i]++; if (mask[1][0] != mask[1][1]) diff[i]++; if (mask[1][1] != mask[1][2]) diff[i]++; if (mask[1][2] != mask[1][3]) diff[i]++; if (mask[2][0] != mask[2][1]) diff[i]++; if (mask[2][1] != mask[2][2]) diff[i]++; if (mask[2][2] != mask[2][3]) diff[i]++; if (mask[3][0] != mask[3][1]) diff[i]++; if (mask[3][1] != mask[3][2]) diff[i]++; if (mask[3][2] != mask[3][3]) diff[i]++; if (mask[0][0] != mask[1][0]) diff[i]++; if (mask[1][0] != mask[2][0]) diff[i]++; if (mask[2][0] != mask[3][0]) diff[i]++; if (mask[0][1] != mask[1][1]) diff[i]++; if (mask[1][1] != mask[2][1]) diff[i]++; if (mask[2][1] != mask[3][1]) diff[i]++; if (mask[0][2] != mask[1][2]) diff[i]++; if (mask[1][2] != mask[2][2]) diff[i]++; if (mask[2][2] != mask[3][2]) diff[i]++; if (mask[0][3] != mask[1][3]) diff[i]++; if (mask[1][3] != mask[2][3]) diff[i]++; if (mask[2][3] != mask[3][3]) diff[i]++; } dp[0][0] = 1; rep(i, 1 << 16) { rep(j, 16) { rep(k, 217) { if (i & (1 << j)) continue; dp[i | (1 << j)][k + diff[i]] += dp[i][k]; } } } std::cout << dp[(1 << 16) - 1][K] << std::endl; return 0; }