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.*;
public class Main {
	static int N;
	static int bfs(int sum,int n){
		if(n==4&&sum==N)return 1;
		else if(n==4&&sum!=N)return 0;
		int cnt = 0;
		for(int i=0;i<=9;i++)if(sum+i<=N)cnt+=bfs(sum+i,n+1);
		return cnt;
	}
	public static void main(String[] args){
		Scanner in = new Scanner(System.in);
		while(in.hasNext()){
			N = in.nextInt();
			System.out.println(bfs(0,0));
		}
	}
}