Problem:
Sum of 4 Integers

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.

Sample Input

35
1

Output for the Sample Input

4
4

Solution in C (judge verdict: Time Limit Exceeded)

#include<stdio.h>


int main(){

  int n, i, j, k, l, cnt;

  while(1){

    scanf("%d", &n);
    cnt=0;
    for(i=9;i>=0;i--){
      for(j=9;j>=0;j--){
	for(k=9;k>=0;k--){
	  for(l=9;l>=0;l--){
	    if(i+j+k+l==n){
	      cnt++;
	    }
	  }
	}
      }
    }

  printf("%d\n", cnt);
  }
  return 0;
  
}