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){
		Scanner sc=new Scanner(System.in);
		while(sc.hasNextInt()){
			int cnt=0;
			int n=sc.nextInt();
			if(n>50) break;
			for(int i1=0;i1<=n;i1++){
				if(i1>9) continue;
				for(int i2=0;i2<=n-i1;i2++){
					if(i2>9) continue;
					for(int i3=0;i3<=n-i1-i2;i3++){
						if(i3>9) continue;
						if(n-i1-i2-i3>9) continue;
						cnt++;
					}
				}
			}
			System.out.println(cnt);
		}
		sc.close();
	}
}