#include <cstdio>
#include <algorithm>
#include <iostream>

using namespace std;

const int N = 6;
const int M = 55;

int dp[N][M];


void init()
{
	memset(dp, 0, sizeof(dp));
	dp[0][0] = 1;
	for(int i = 0; i < N - 1; ++i) {
		for(int j = 0; j <= i*9; ++j) {
			if(dp[i][j] != 0) {
				for(int k = 0; k <= 9; ++k) {
					dp[i+1][j+k] += dp[i][j];
				}
			}
		}
	}
}

int main()
{
	int n;
	init();
	while(cin >> n) {
		int ans = 0;
		int half = (n + 1) / 2, maxs = half*9;
		for(int i = 0; i <= maxs; ++i) {
			ans += dp[half][i] * dp[n - half][i];
		}
		cout << ans << endl;
	}

}