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;

/**
 * @author yamamotoa
 *
 */
public class Main {
	static Scanner sc = new Scanner(System.in);

	public static void main(String[] args) {
		int ans;
		int num;
		while(sc.hasNext()) {
			num = sc.nextInt();
			ans = 0;

			for(int a = 0; a < 10; a++) {
				for(int b = 0; b < 10; b++) {
					for(int c = 0; c < 10; c++) {
						for(int d = 0; d < 10; d++) {
							if(a + b + c + d == num) {
								ans++;
							}
						}
					}
				}
			}
			System.out.println(ans);
		}

	}

}