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<stdio.h>
int main(void)
{
	int a,s,d,f,g,i,j;
	while(scanf("%d",&a)!=EOF){
		s=0;
		for(i=0;i<=9;i++){
			for(j=0;j<=9;j++){
				for(f=0;f<=9;f++){
					for(g=0;g<=9;g++){
						if(a==i+j+f+g){
							s++;
						}
					}
				}
			}
		}
		printf("%d\n",s);
	}
	return 0;
}