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
#include <iostream>
using namespace std;

#define REP(i,n) for (int (i) = 0; (i) <= (n); ++(i))
int main() {
    int n;
    int ret = 0;
    while(cin>>n){
        ret =0 ;
        REP(a, 9)REP(b, 9)REP(c, 9)REP(d, 9)if(a+b+c+d == n)ret++;
        cout<<ret<<endl;
    }
    return 0;
}