#include <bits/stdc++.h>
#include <atcoder/all>
#define rep(i, a, n) for (int i = (int)(a); i <= (int)(n); ++i)
#define rrep(i, a, n) for (int i = (int)(a); i >= (int)(n); --i)
#define debug(x) cerr << #x << " = " << x << "\n"
#define debugv(x) \
  rep(f, 0, (x.size() - 1)) cerr << x[f] << (f == (x.size() - 1) ? "\n" : " ")
#define debug2(x, y)                       \
  cerr << "(" << #x << "," << #y << ") = " \
       << "(" << x << "," << y << ")\n"
#define all(x) x.begin(), x.end()
#define each(a, x) for (auto &a : (x))
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define int long long
#define yn(x) puts((x ? "Yes" : "No"))
using namespace std;
using pii = pair<int, int>;
using vi = vector<int>;
const int MX = 1e5 + 5, INF = 5LL << 57, MOD = 1e9 + 7;

int N, M;
string S;
vi va, vb;

void input()
{
  ;
  cin >> N;
  ;
}
void solve()
{
  int n = N;
  // 2,3,5
  int ans = 0;
  rep(i, 0, n)
  {
    rep(j, 0, n)
    {
      rep(k, 0, n)
      {
        if (i * 2 + j * 3 + k * 5 == N)
        {
          if (i <= k)
          {
            ans++;
          }
        }
      }
    }
  }
  cout << ans << endl;

  ;
  ;
}
signed main()
{
  cout << setprecision(12);
  input();
  solve();
  return 0;
}