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
from __future__ import (division, absolute_import, print_function,
                        unicode_literals)
from sys import stdin
for line in stdin:
    n = int(line)
    cnt = 0
    for a in xrange(10):
        if n < a:
            break
        for ab in xrange(a, a + 10):
            if n < ab:
                break
            for abc in xrange(ab, ab + 10):
                if n < abc:
                    break
                for abcd in xrange(abc, abc + 10):
                    if n == abcd:
                        cnt += 1
                        break
                    if n < abcd:
                        break
    print(cnt)