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;

//Sum of 4 Integers
public class Main{

	public static int n;
	public static int ans;

	public static void dfs(int k, int s){
		if(n<s)return;
		if(k==4){
			if(s==n)ans++;
			return;
		}
		for(int i=0;i<10;i++){
			dfs(k+1, s+i);
		}
	}

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		while(sc.hasNext()){
			n = sc.nextInt();
			ans = 0;
			dfs(0, 0);
			System.out.println(ans);
		}
	}
}