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>
#include<iostream>
#include<algorithm>
#include<string.h>
using namespace std;
int main(){
int i,n,j,l,e,g;
while(cin>>n){
g=0;
for(i=0;i<10;i++){
for(j=0;j<10;j++){
for(l=0;l<10;l++){
for(e=0;e<10;e++){
if(i+j+l+e==n)g++;
}
}
}
}
cout<<g<<endl;
}
return 0;
}