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 static java.lang.System.*;

public class Main {

	Scanner sc = new Scanner(in);
	
	void run() {
		while (sc.hasNext()) {
			int n = sc.nextInt();
			int res = 0;
			for (int i1 = 0; i1 < 10; i1++)
				for (int i2 = 0; i2 < 10; i2++)
					for (int i3 = 0; i3 < 10; i3++)
						for (int i4 = 0; i4 < 10; i4++)
							if (i1+i2+i3+i4 == n)
								res++;
			out.println(res);
				
		}
	}
	
	public static void main(String[] args) {
		new Main().run();
	}

}