Problem:
Sum of 4 Integers

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.

Sample Input

35
1

Output for the Sample Input

4
4

Solution in C# (judge verdict: Accepted)

using System;
using System.Collections.Generic;
using System.Linq;


class Program
    {
        static void Main(string[] args) {
            const short N = 51;
            short i=0;
            int[][] K = new int[4][];
            List<int> n = new List<int>();
            string s;
            for (i = 0; i < 4; i++)
                K[i] = new int[N];
            for (i = 0; i < N; i++)
                K[0][i] = (i<10)?1:0;
            for (i = 0; i < 3; i++)
                K[i+1] = S(K[i]);

            while (true)
            {
                s = Console.ReadLine();
                if (string.IsNullOrEmpty(s)) break;
                n.Add(int.Parse(s));
            }
            foreach(int n1 in n)
            Console.WriteLine(K[3][n1]);
        }

        public static int[] S(int[] I) {
            int[] A = new int[51];
            for (int i = 0; i < 51; i++) {
                for (int j = 0; j < 10; j++) {
                    A[i] += (i - j < 0 || i - j >= 51) ? 0 : I[i - j];
                }
            }
            return A;
        }

    }