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.io.*;

public class Main {
	public static void main(String[] args) throws Exception {
		String s="";
		BufferedReader bf = new BufferedReader(new InputStreamReader(System.in));
		int t[] = new int[19];
		for(int i=0;i<9;i++)t[i]=t[18-i]=i+1;t[9]=10;
		while((s = bf.readLine())!=null){
			int n = Integer.parseInt(s);
			int a=0;for(int i=0;i<19;i++)if(n>=i && (n-i)<19)a+=t[i]*t[n-i];
			System.out.println(a);
		}
	}
}