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.io.*;

public class Main
{
    public static void main(String[] args) throws IOException
    {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String s;
        while((s = br.readLine()) != null)
        {
            int count = 0;
            int n = Integer.parseInt(s);
            if(n <= 36)
            {
                if (n > 18) n = 36 - n;
                count = (n + 1) * (n + 2) * (n + 3) / 6;
                if (n > 9) count -= 2 * (n - 9) * (n - 8) * (n - 7) / 3;

            }
            System.out.println(count);
        }
    }
}
