#include <iostream>
#include <vector>
#include <algorithm>

#define ascent(i, a, b) for(int (i) = (a); (i) < (b); (i) ++)

using namespace std;

int main() {
  int tmp;
  vector<int> n;
  while(cin >> tmp) {
    n.push_back(tmp);
  }

  ascent(i, 0, n.size()) {
    int ans = 0;
    ascent(a, 0, 10) {
      ascent(b, 0, 10) {
	ascent(c, 0, 10) {
	  ascent(d, 0, 10) {
	    if(a + b + c + d == n[i]) {
	      ans ++;
	    }
	  }
	}
      }
    }
    cout << ans << endl;
  }
  
  return 0;
}