#include <bits/stdc++.h>
using namespace std;
double EPS = 1e-9;
int INF = 1000000007;
long long INFF = 1000000000000000007LL;
double PI = acos(-1);
int dirx[8] = {-1, 0, 0, 1, -1, -1, 1, 1};
int diry[8] = {0, 1, -1, 0, -1, 1, -1, 1};
void solve();
long long power(long long a, long long b);
vector<bool> sieve();
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int t = 1;
  while (t--) {
    solve();
    cout << "\n";
  }
  cerr << "time taken : " << (float)clock() / CLOCKS_PER_SEC << " secs" << endl;
  return 0;
}
void solve() {
  cout << setprecision(12);
  int n = 0;
  cin >> n;
  n = n - 10;
  vector<int> ways(12);
  for (int i = 1; i < 10; i++) {
    ways[i] = 4;
  }
  ways[10] = 15;
  ways[11] = 4;
  if (n > 11 || n <= 0)
    cout << 0;
  else
    cout << ways[n];
  return;
}
vector<bool> sieve() {
  vector<bool> primes(1000001, 1);
  primes[0] = 0;
  primes[1] = 0;
  for (long long i = 4; i < 1000001; i += 2) {
    primes[i] = 0;
  }
  for (int i = 3; i * i < 1000001; i += 2) {
    for (long long j = i * i; j < 1000001; j += i) {
      primes[j] = 0;
    }
  }
  return primes;
}
long long power(long long a, long long b) {
  long long result = 1;
  while (b > 0) {
    result = result * result;
    if (b % 2 != 0) {
      result = result * a;
    }
    a = a * a;
    b >>= 1;
  }
  return result;
}
