Write a program which reads an integer n and identifies the number of combinations of a, b, c and d (0 ≤ a, b, c, d ≤ 9) which meet the following equality:

a + b + c + d = n

For example, for n = 35, we have 4 different combinations of (a, b, c, d): (8, 9, 9, 9), (9, 8, 9, 9), (9, 9, 8, 9), and (9, 9, 9, 8).



Input

The input consists of several datasets. Each dataset consists of n (1 ≤ n ≤ 50) in a line. The number of datasets is less than or equal to 50.

Output

Print the number of combination in a line.

Example

Input

35
1


Output

4
4
#include <iostream>

#define rep(i,n)      for(int i=0;i<n;i++)

using namespace std;

int table[36 + 1];

int main()
{
	rep(a,10)rep(b,10)rep(c,10)rep(d,10) table[a+b+c+d]++;

	int N;
	while (cin>>N)
	{
		if (N > 36)
			cout << 0 << endl;
		else
			cout << table[N] << endl;
	}
	return 0;
}