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
# -*- coding: utf-8 -*-

import sys

def mCn(m, n):
    ret = 1
    for i in xrange(n):
        ret *= m - i
        ret /= i + 1
    return ret

#for line in ["35"]:
for line in sys.stdin.readlines():
    List = map(int, line.strip().split())

    n = List[0]

    ans = 0
    for i in xrange(10000):
        a = i / 1000; i %= 1000
        b = i / 100 ; i %= 100
        c = i / 10  ; i %= 10
        d = i
        if(a + b + c + d == n):
            ans += 1

    print ans