Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func nextString() string {
	scanner.Scan()
	return scanner.Text()
}

func nextInt() (int, error) {
	return strconv.Atoi(nextString())
}

func main() {
	scanner.Split(bufio.ScanWords)

	counts := map[int]int{}
	for i := 0; i < 10; i++ {
		for j := 0; j < 10; j++ {
			for k := 0; k < 10; k++ {
				for l := 0; l < 10; l++ {
					s := i + j + k + l
					if s <= 50 {
						counts[s]++
					}
				}
			}
		}
	}
	// fmt.Println(counts)
	for {
		n, err := nextInt()
		if err != nil {
			break
		}
		cnt, ok := counts[n]
		if ok {
			fmt.Println(cnt)
		} else {
			fmt.Println(0)
		}
	}
}

C++: #include<iostream>
#include <fstream>
#include <stdio.h>
#include <stdlib.h>
#define _USE_MATH_DEFINES
#include <math.h>
#include<string>
#include<vector>
#include<cmath>
#include<stack>
#include<queue>
#include<sstream>
#include<algorithm>
#include<map>
#include<complex>
using namespace std;


#define li			long long int
#define rep(i,to)	for(int i=0;i<((int)(to));i++)
#define repp(i,start,to)	for(int i=(int)(start);i<((int)(to));i++)
#define pb			push_back
#define sz(v)		((li)(v).size())
#define bgn(v)		((v).begin())
#define eend(v)		((v).end())
#define allof(v)	(v).begin(), (v).end()
#define dodp(v,n)		memset(v,(li)n,sizeof(v))
#define bit(n)		(1ll<<(li)(n))
#define mp(a,b)		make_pair(a,b)
#define rin	rep(i,n)
#define EPS 1e-10
#define ETOL 1e-8
#define MOD 1000000007
#define p2(a,b)		cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)		cout<<a<<"\t"<<b<<"\t"<<c<<endl


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

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

int main(){
	int n,num;
	while(cin >> n){
		num = 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)++num;
					}
				}
			}
		}
		cout << num << '\n';
	}
	return 0;
}

C++: //52
#include<iostream>

using namespace std;

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

C++: #include <iostream>

using namespace std;

int main() {
    int n,i,j,k,l,ans = 0;

    cin >> n;

    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){
                        ans++;
                    }
                }
            }
        }
    }

    cout << ans << endl;
    
    return 0;
}

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

int combination(int n){
  int temp = 0;
  for(int i = 0;i < 10;i++)
    for(int j = 0;j < 10;j++)
      for(int k = 0;k < 10;k++)
	if((n - i - j - k) >= 0 && (n -i -j -k) <10)
	  temp++;
  return temp;
}


int main(){
  int n;
  while(1){
    cin >> n;
    cout << combination(n) << endl;
  }
}

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

int main(){
  
  vector<int> count_array;
  int count;
  int in_num;
  int a,b,c,d,i=0;
  while(cin>>in_num){
    count=0;
    if(in_num>36){
      count_array.push_back(0);
    }
    else{
      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)==in_num){
		count++;
	      }
	    }
	  }
	}
      }
      count_array.push_back(count);
    }
    i++;
  }
  for(int j=0;j<i;j++){
    cout<<count_array[j]<<endl;
  } 
}

C++: #include<stdio.h>
int main(void)
{
	int a,s,d,f,g,i,j;
	while(scanf("%d",&a)!=EOF){
		s=0;
		for(i=0;i<=9;i++){
			for(j=0;j<=9;j++){
				for(f=0;f<=9;f++){
					for(g=0;g<=9;g++){
						if(a==i+j+f+g){
							s++;
						}
					}
				}
			}
		}
		printf("%d\n",s);
	}
	return 0;
}

C++: #include <cstdio>

using namespace std;

int main(void){
	int i, j, k, l, ans = 0, n;
	while(scanf("%d",&n) != EOF){
		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){
							ans++;
						}
					}
				}
			}
		}
		printf("%d\n",ans);
	}
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){
  int n;
  while(cin >>n){
    int sum = 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(n == a+b+c+d){sum++;}
	  }
	}
      }
    }
    cout <<sum<<endl;
  }
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;

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 x = n - i - j - k;
//                    cout << i << ' ' << j << ' ' << k << ' ' << x << endl;
                    if(x >= 0 && x < 10) ans++;
                }
            }
        }
        cout << ans << endl;
    }
    return 0;

}

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

#define rep(i,n) for(int i=0; i<n; i++)
int main(){
	int n, ans;
	cin >> n;
	rep(i,10) rep(j,10) rep(k,10) rep(l,10) if(i+j+k+l==n) ans++;
	cout << ans << endl;
    return 0;
}

C++: #include<cstdio>
#include<cstring>
#include<algorithm>
#include<functional>
using namespace std;
int main(void)
{
	int i,j,k,l,n,cnt;
	scanf("%d",&n);
	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(i+j+k+l==n) cnt++;
				}
			}
		}
	}
	printf("%d\n",cnt);
	return 0;
}

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

#define rep(i, j) for(int i = 0; i < j; i++)
#define all(i) i.begin(), i.end()
#define ll long long
#define bl bool
#define nn printf("\n");
#define mod 1000000007

using namespace std;

int main()
{
	cin.tie(0);
	ios::sync_with_stdio(false);

	int n = 0;
	while (cin >> n)
	{
		int a = 0, b = 0, c = 0, d = 0;
		int num = 0;

		rep(i, 10)
		{
			rep(j, 10)
			{
				rep(k, 10)
				{
					rep(l, 10)
					{
						if(i + j + k + l == n)
						{
							num += 1;
						}
					}
				}
			}
		}
		printf("%d\n", num);
	}

	return 0;
}

C++: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>

using namespace std;
static const double EPS = 1e-10;

int solve(int a, int b, int c, int d, int n){

	return 0;
}

int main(){
	int n, cnt;

	while(cin >> n){
		cnt = 0;
		if(n <= 36)
			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) cnt++;

		cout << cnt << endl;
	}

	return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
int main(){
	int n;
	cin>>n;
	while(cin>>n){
		int count=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)count++;
					}
				}
			}
		}
		cout<<count<<endl;
	}
    return 0;
}

C++: #include <iostream>
using namespace std;
int main(){
	int n,a,b,c,d;
	while(cin >> n){
		int count=0;
		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(n==a+b+c+d)count++;
					}
				}
			}
		}
		cout << count<<endl;
	}
	return 0;
}