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 {
	public static void main(String[] args) {
		final int MAX = 9;
		Scanner sc = new Scanner(System.in);
		int[] data = new int [MAX*2+1];
		
		for(int i = 0; i <= MAX*2; i++){
			for(int k = 0; k <= i; k++){
				if (k <= MAX && (i-k)<= MAX){
					data[i]++;
				}
			}
		}
		
		while(sc.hasNext()){
			int n = 0;
			int in = sc.nextInt();
			if(in >= 0 && in <= MAX*4){
				for(int j = 0; j <= in; j++){
					if(j > MAX*2 || in-j > MAX*2){
						continue;
					}
					n += data[j] * data[in-j];
				}
			}
			System.out.println(n);
		}
	}
}