Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

func main() {
	scanner := bufio.NewScanner(os.Stdin)

	for scanner.Scan() {
		count := 0
		for i := 9; i >= 0; i-- {
			numCpy, _ := strconv.Atoi(scanner.Text())
			if numCpy-i >= 0 {
				for j := 9; j >= 0; j-- {
					numCpyi := numCpy - i
					if numCpyi-j >= 0 {
						for k := 9; k >= 0; k-- {
							numCpyj := numCpyi - j
							if numCpyj-k >= 0 {
								for l := 9; l >= 0; l-- {
									numCpyk := numCpyj - k
									if numCpyk-l == 0 {
										count++
										break
									}
								}
							}
						}
					}
				}
			}
		}
		fmt.Println(count)
	}

}

C++: #include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <set>
#include <map>
#include <cmath>
//ranker
using namespace std;

#define REPS(i, a, n) for (int i = (a); i < (n); ++i)
#define REP(i, n) REPS(i, 0, n)
#define RREP(i, n) REPS(i, 1, n + 1)
#define DEPS(i, a, n) for (int i = (a); i >= n; --i)
#define DEP(i, n) DEPS(i, n, 0)

using ll = long long;
using ull = unsigned long long;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using pii = pair<int, int>;
using pis = pair<int, string>;
using psi = pair<string, int>;
using D = double;


int main(){
  int n, cnt=0;
  while(cin >> n){
    cnt = 0;
    REP(i, 10) REP(j, 10) REP(k, 10) REP(l, 10) if(i + j + k + l == n) cnt++;
    cout << cnt << endl;
  }
  return 0;
}

C++: #include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;
int main(){
    int n[60]={0};
    int sum;
    for(int a=0;a<10;a++)
    {
        for(int b=0;b<10;b++)
        {
            for(int c=0;c<10;c++)
            {

                for(int d=0;d<10;d++)
                {
                    sum=a+b+c+d;
                    n[sum]++;
                }
            }

        }
    }
    int num;
    while(scanf("%d",&num)!=EOF)
        printf("%d\n",n[num]);


    return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
#define FOR(i,a,n) for(int (i)=(a);(i)<(n);(i)++)
#define eFOR(i,a,n) for(int (i)=(a);(i)<=(n);(i)++)
#define rFOR(i,a,n) for(int (i)=(n)-1;(i)>=(a);(i)--)
#define erFOR(i,a,n) for(int (i)=(n);(i)>=(a);(i)--)
#define SORT(i) sort((i).begin(),(i).end())
#define rSORT(i,a) sort((i).begin(),(i).end(),(a))
#define all(i) (i).begin(),(i).end()
constexpr ll INF = 1000000000;
constexpr ll LLINF = 1LL << 60;
constexpr ll mod = 1000000007;
constexpr ll MOD = 998244353;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; }return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; }return 0; }
inline void init() { cin.tie(nullptr); cout.tie(nullptr); cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); }

int main() {
    init();

    int n;
    while (cin >> n) {
        int ans = 0;
        FOR(a, 0, 10)FOR(b, 0, 10)FOR(c, 0, 10)FOR(d, 0, 10) {
            if (a + b + c + d == n)ans++;
        }
        cout << ans << "\n";
    }
}

C++: #include <iostream>
#include <algorithm>
#include <set>
#include <vector>

using namespace std;

int solve(const int n) {
	set< vector<int> > s;
	vector<int> v(4);
	for (v[0] = 0; v[0] < 10; v[0]++)
		for (v[1] = 0; v[1] < 10; v[1]++)
			for (v[2] = 0; v[2] < 10; v[2]++)
				for (v[3] = 0; v[3] < 10; v[3]++) {
					int sum = 0;
					for (int i = 0; i < 4; i++) sum += v[i];
					if (sum == n) {
						s.insert(v);
						break;
					}
				}
	return s.size();
}

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	while (cin) {
		int n;
		cin >> n;
		cout << solve(n) << endl;
	}
	return 0;
}

C++: #include <iostream>
#include <cstdio>
using namespace std;

int ans = 0;

int r(int,int);

int main(){
    int n;
    while(-1!=scanf("%d", &n)){
        ans = 0;
        r(4,n);
        cout << ans << endl;
    }
    return 0;
}

int r(int d,int n){
    if(n==0){
        ans++;
        return 0;
    }
    if(n<0 || d <= 0) return 0;

    for(int i=0; i<=9; i++){
        r(d-1, n-i);
    }
    return 0;
}

C++: #include <iostream>
using namespace std;

int main(){
	int n,ans;

	while( cin >> n ){
		ans = 0;
		if(n<=36){
			for(int a=0 ; a<=9 ; a++){
				for(int b=0 ; b<=9 ; b++){
					for(int c=0 ; c<=9 ; c++){
						for(int d=0 ; d<=9 ; d++){
							if((a+b+c+d)==n){
								ans++;
							}
						}
					}
				}
			}
		}
		cout << ans << endl;
	}
}

C++: #include<iostream>

int main(){
        int n;
        while(std::cin >> n){
                int comb = 0;
                for(int a=0;a<10;a++){
                        for(int b=0;b<10;b++){
                                for(int c=0;c<10;c++){
                                        for(int d=0;d<10;d++){
                                                if(a+b+c+d == n) comb++;
                                        }
                                }
                        }
                }
                std::cout << comb << std::endl;
        }
        return 0;
}

C++: #include <cstdio>
using namespace std;

int main(){
	int n;
	int res;
	
	while((scanf("%d", &n)) != EOF){
		res = 0;
		for(int a = 0; a < 10; a++){
			for(int b = 0; b < 10; b++){
				for(int c = 0; c < 10; c++){
					for(int d = 0; d < 10; d++){
						if(a + b + c + d == n) res++;
					}
				}
			}
		}
		
		printf("%d\n", res);
	}
	
	return 0;
}

C++: #include <iostream>
#include<cstdio>
using namespace std;

int main(){
  int n;
  while(cin >> n){
    int a = 0, b = 0, c = 0, d = 0, m = 0;
    for(int i = 0; i < 10; i++){
      for(int j = 0; j < 10; j++){
	for(int k = 0; k < 10; k++){
	  for(int l = 0; l < 10; l++){
	    if(i+j+k+l == n) m++;
	  }
	}
      }
    }
  }

  cout << m << endl;

  return 0;
}

C++: #include <iostream>
#include <cstdio>
using namespace std;

int main(){
  int a,b,c,d,n,count = 0;
  
  while(scanf("%d",&n)!=EOF){
  
  for(a=0;a<10;a++){
    for(b=0;b<10;b++){
      for(c=0;c<10;c++){
	for(d=0;d<10;d++){
	  if((a+b+c+d)==n)count++;
	}
      }
    }
  }
  
  cout << count << endl;
  }
  return 0;
}

C++: #include<iostream>

using namespace std;

int n;
int count;

int main()
{
	while(cin>>n)
	{
		for(int i=0;i<=9;++i)
		{
			for(int j=0;j<=9;++j)
			{
				for(int k=0;k<=9;++k)
				{
					for(int l=0;l<=9;++l)
					{
						if(i+j+k+l==n)
						{
							++count;
						}
					}
				}
			}
		}
		cout<<count<<endl;
		count = 0;
	}
}

C++: #include <stdio.h>

int main(void)
{
    int i,j,k,l,n,cnt;
    while(scanf("%d",&n)==1){
        cnt = 0;
        for(i=0;i<=9;i++)
            for(j=0;j<=9;j++)
                for(k=0;k<=9;k++)
                    for(l=0;l<=9;l++)
                        if(n==(i+j+k+l))cnt++;
        printf("%d\n",cnt);
    }
    return 0;
}

C++: #include <iostream>
#include <stdio.h>
#include <string.h>
#include <math.h>
#include <algorithm>
#include <stdlib.h>

using namespace std;


int main(){

	int n;

	while(cin >> n){
		int i, j, k, l;
		int count=0;

		for(i=0 ; i<10 ; i++){
			for(j=0 ; j<10 ; j++){
				for(k=0 ; k<10 ; k++){
					for(l=0 ; l<10 ; l++){
						if((i+j+k+l) == n)count++;
					}
				}
			}
		}

		cout << count << endl;
	}

	return 0;
}

C++: #include <iostream>

using namespace std;

int main()
{
	int n, t; int cnt = 0;

	cin >> n;

	for (int i = 0; i < 10; i++)
	{
		for (int j = 0; j < 10; j++)
		{
			for (int k = 0; k < 10; k++)
			{
				t = n - (i + j + k);

				if (0 <= t || t < 10) { cnt++; }
			}
		}
	}

	cout << cnt << endl;

	return 0;
}

C++: #include<iostream>
using namespace std;

int main(void){
  int c;
  while(cin >> c){
    int cnt = 0;
    for(int i = 0; i < 10; i++)
      for(int j = 0; j < 10; j++)
	for(int k = 0; k < 10; k++)
	  for(int l = 0; l < 10; l++)
	    if(i * j * k * l == c)
	      cnt++;
    cout << cnt << endl;
  }
  return 0;
}