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
import java.util.Scanner;
 
class Main{
public static void main(String[] args){
Scanner sc=new Scanner(System.in);
while(sc.hasNextInt()){
int n=sc.nextInt();
int num=0;
if(n<=36){
for(int a=0;a<=9;a++){
for(int b=0;b<=9;b++){
for(int c=0;c<=9;c++){
if(binary_search(n-a-b-c)){
num++;
}
}
}
}
}
System.out.println(num);
}
}
public static boolean binary_search(int x){
int[] n=new int[10];
for(int a=0;a<=9;a++){
n[a]=a;
}
int l=0;
int r=10;
while(r-l>=1){
int i=(int)(l+r)/2;
if(x==n[i]){
return true;
}
else if(x>n[i]){
l=i+1;
}
else{
r=i;
}
}
return false;
}
}