#include void fft(std::vector>& a, bool invert) { const double PI = acos(-1.0); int n = a.size(); for (int i = 1, j = 0; i < n; ++i) { int bit = n >> 1; for (; j & bit; bit >>= 1) { j -= bit; } j += bit; if (i < j) std::swap(a[i], a[j]); } for (int len = 2; len <= n; len <<= 1) { double angle = 2 * PI / len * (invert ? -1 : 1); std::complex wlen(cos(angle), sin(angle)); for (int i = 0; i < n; i += len) { std::complex w(1); for (int j = 0; j < len / 2; ++j) { std::complex u = a[i + j]; std::complex v = a[i + j + len / 2] * w; a[i + j] = u + v; a[i + j + len / 2] = u - v; w *= wlen; } } } if (invert) { for (std::complex &x : a) { x /= n; } } } std::vector convolution(const std::vector& a, const std::vector& b) { std::vector> fa(a.begin(), a.end()), fb(b.begin(), b.end()); int n = 1; while (n < (int)a.size() + (int)b.size() - 1) n <<= 1; fa.resize(n); fb.resize(n); fft(fa, false); fft(fb, false); for (int i = 0; i < n; ++i) { fa[i] *= fb[i]; } fft(fa, true); std::vector res(n); for (int i = 0; i < n; ++i) { res[i] = llround(fa[i].real()); } return res; } int main() { int n; std::cin >> n; std::vector a(n + 1, 1); for (int i = 0; i < 3; ++i) { a = convolution(a, a); } std::cout << a[n * 6] << std::endl; }