Go: package main
import (
	"fmt"
	"os"
	"strconv"
	"bufio"
)

var sc = bufio.NewScanner(os.Stdin)

func main(){
	for sc.Scan(){
		n := nextInt()
		cnt := 0
		// 37以上のとき組み合わせは存在しないが省くのめんどくさいのでまとめて計算
		for a:=0; a<=9; a++{
			for b:=0; b<=9; b++{
				for c:=0; c<=9; c++{
					for d:=0; d<=9; d++{
						if a+b+c+d==n{
							cnt++
						}
					}
				}
			}
		}
		fmt.Println(cnt)
	}
}

func next()string{
	//sc.Scan()
	return sc.Text()
}

func nextInt()int{
	a, _ := strconv.Atoi(next())
	return a
}

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

int main(){
	std::ios::sync_with_stdio(false);
    std::cin.tie(0);
	
	int a[50]={0};int n=0;
	while(cin>>a[n++]);n--;
	for(int i=0;i<n;i++){
		if(a[i]>36)cout<<"0"<<endl;
		else if(a[i]==36||a[i]==0)cout<<"1"<<endl;
		else if(a[i]==35||a[i]==1)cout<<"4"<<endl;
		else if(a[i]==34||a[i]==2)cout<<"10"<<endl;
		else if(a[i]==33||a[i]==3)cout<<"20"<<endl;
		else if(a[i]==32||a[i]==4)cout<<"35"<<endl;
		else if(a[i]==31||a[i]==5)cout<<"56"<<endl;
		else if(a[i]==30||a[i]==6)cout<<"84"<<endl;
		else if(a[i]==29||a[i]==7)cout<<"120"<<endl;
		else if(a[i]==28||a[i]==8)cout<<"165"<<endl;
		else if(a[i]==27||a[i]==9)cout<<"220"<<endl;
		else if(a[i]==26||a[i]==10)cout<<"286"<<endl;
		else if(a[i]==25||a[i]==11)cout<<"364"<<endl;
		else if(a[i]==24||a[i]==12)cout<<"455"<<endl;
		else if(a[i]==23||a[i]==13)cout<<"560"<<endl;
		else if(a[i]==22||a[i]==14)cout<<"680"<<endl;
		else if(a[i]==21||a[i]==15)cout<<"816"<<endl;
		else if(a[i]==20||a[i]==16)cout<<"969"<<endl;
		else if(a[i]==19||a[i]==17)cout<<"1140"<<endl;
		else cout<<"1330"<<endl;
		
	}
	return 0;
}

C++: //↓template↓

#include "bits/stdc++.h"
using namespace std;
#define Would
#define you
#define all(n)  n.begin(),n.end()
const long long INF = 1e18;
const long long MOD = 1e9 + 7;
const double pi = acos(-1);
const int SIZE = 1 << 17;
int dx[] = { 1,0,-1,0 }, dy[] = { 0,1,0,-1 }, alp[30];
long long fac[200005], finv[200005], inv[200005];
vector<long long>dij;
struct edge { long long to, cost; };
vector<vector<edge> >G;

long long mod_pow(long long a, long long b) {
	long long res = 1, mul = a;
	for (int i = 0; i < 31; ++i) {
		if (b >> i & 1) {
			res *= mul;
			res %= MOD;
		}
		mul = (mul * mul) % MOD;
	}

	return res;
}

void addedge(int from, int to, int cost) {
	G[from].push_back({ to,cost });
	G[to].push_back({ from,cost });
}

//↑template↑

int main() {
	int n;
	while (cin >> n) {
		int ans = 0;
		for (int i = 0; i <= 9; ++i) {
			for (int j = 0; j <= 9; ++j) {
				for (int k = 0; k <= 9; ++k) {
					int mon = n - i - j - k;
					if (0 <= mon && mon <= 9) { ++ans; }
				}
			}
		}
		cout << ans << endl;
	}
}

C++: #include <iostream>

int sumOf2_upTo18(int sum);
int sumOf2_upTo9(int sum);

int main()
{
    int sum;
    while (std::cin >> sum) {
        int cnt = sumOf2_upTo18(sum);
        std::cout << cnt << std::endl;
    }

    return 0;
}

int sumOf2_upTo18(int sum)
{
    int cnt = 0;
    for (int k = 0; k <= 18; k++) {
        int l = sum - k;
        if (l >= 0 && l <= 18) {
            int cnt_k = sumOf2_upTo9(k);
            int cnt_l = sumOf2_upTo9(l);
            cnt += cnt_k * cnt_l;
        }
    }

    return cnt;
}

int sumOf2_upTo9(int sum)
{
    int cnt = 0;
    for (int a = 0; a <= 9; a++) {
        int b = sum - a;
        if (b >= 0 && b <= 9) {
            cnt++;
        }
    }

    return cnt;
}

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

int main(){
	int n;
	int cnt;
	while(cin >> n){
		cnt = 0;
		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){
							cnt++;
						}
					}
				}
			}
		}
		cout << cnt << endl;
	}
}

C++: #include <stdio.h>

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

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

int main()
{
    int n;
    while(cin>>n)
    {
        int ans=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)ans++;
                }
            }
        }
        cout<<ans<<endl;
    }
    return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;

#define EACH(i,a) for (auto& i : a)
#define FOR(i,a,b) for (ll i=(a);i<(b);i++)
#define RFOR(i,a,b) for (ll i=(b)-1;i>=(a);i--)
#define REP(i,n) for (ll i=0;i<(n);i++)
#define RREP(i,n) for (ll i=(n)-1;i>=0;i--)
#define debug(x) cout<<#x<<": "<<x<<endl
#define pb push_back
#define ALL(a) (a).begin(),(a).end()

const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);

template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
	EACH(x,vec) is >> x;
	return is;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& vec) {
	REP(i,vec.size()) {
		if (i) os << " ";
		os << vec[i];
	}
	return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector< vector<T> >& vec) {
	REP(i,vec.size()) {
		if (i) os << endl;
		os << vec[i];
	}
	return os;
}

int main() {
	std::ios::sync_with_stdio(false);
	std::cin.tie(0);
	int N;
	while (cin >> N) {
		ll ans = 0;
		REP(a, 10) REP(b, 10) REP(c, 10) REP(d, 10) {
			if (a + b + c + d == N) {
				++ans;
			}
		}
		cout << ans << endl;
	}
}

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

int n;
int ans;

int main(void)
{


	while(cin >> n, n){
		ans = 0;
		int d[4][61] = {};

		for(int i = 0; i <= 9; i++)
			d[0][i]++;
		for(int i = 0; i < 3; i++){
			for(int j = 0; j <= 9; j++){
				for(int k = 0; k <= 50; k++){
					d[i+1][k+j] += d[i][k];
				}
			}
		}

		ans = d[3][n];
		cout << ans << endl;
	}


	return 0;
}