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
#!/usr/bin/env python
# -*- coding: utf-8 -*-

import sys

money = 100000

for s in sys.stdin:
  count = 0
  d = int(s)
  for i1 in range(10):
    if i1 > d:
      pass
    for i2 in range(10):
      if i1 + i2 > d:
        pass
      for i3 in range(10):
        if i1 + i2 + i3 > d:
          pass
        for i4 in range(10):
          if i1 + i2 + i3 + i4 > d:
            pass
          if i1 + i2 + i3 + i4 == d:
            count += 1
  print count