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 itertools

while True:
  try: n = int ( input ( ) )
  except EOFError: break
  r = 0
  for ( i, j, k ) in itertools.product ( range ( 10 ), range ( 10 ), range ( 10 ) ):
    r += ( 0 <= n - i - j - k < 10 )
  print ( r )