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

public class Main
{
	static int getComb(int n)
	{
		int total = 0;
		for(int i = 0; i <= 9; i++)
			for(int j = 0; j <= 9; j++)
				for(int k = 0; k <= 9; k++)
					for(int z = 0; z <= 9;z++)
						if(i + j + k + z == n)
							total +=1;
		
		return total;
	}
	
	public static void main(String args[]) throws IOException
	{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String s;
		while((s = br.readLine()) != null)
		{
			int n = Integer.parseInt(s);
			System.out.println(getComb(n));
		}
	}
		
}