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(){

int num,i,j,a,b,c,d;
int date[51]={0};


for(i=0;i<=9999;i++){
	
	a=i/1000;
	b=i%1000/100;
	c=i%100/10;
	d=i%10;
	date[a+b+c+d]++;

}


while(scanf("%d",&num)!=EOF){



printf("%d\n",date[num]);
}
return 0;
}