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;
using System.Text;
using System.IO;

namespace ConsoleApplication2 {
    class Program {
        static void Main(string[] args) {

            TextReader input = Console.In;

            string str = "";

            while((str = input.ReadLine()) != null) {
                int cnt = 0;
                int n = 0;
                if (!int.TryParse(str, out n)) {
                    continue;
                }
                int a, b, c, d;
                for (int ii = 0; ii < 10; ii++) {
                    a = ii;
                    for (int jj = 0; jj < 10; jj++) {
                        b = jj;
                        for (int kk = 0; kk < 10; kk++) {
                            c = kk;
                            for (int ll = 0; ll < 10; ll++) {
                                d = ll;
                                if (a + b + c + d == n) {
                                    cnt++;
                                    //Console.WriteLine(string.Format("Hitt{0} {1} {2} {3} = {4}",a,b,c,d,n));
                                }
                            }
                        }
                    }
                }
                Console.WriteLine(cnt);
            }
        }
    }
}