#include<queue>

#include<math.h>

#include<stdio.h>

#include<string.h>

#include<string>

#include<iostream>

#include<algorithm>

using namespace std;

#define N 32788

#define M 12

int n;

int f[N];

int w[]={,,,};

int main()

{

    while(~scanf("%d",&n))

    {

        memset(f,,sizeof(f));

        f[]=;

        for(int i=;i<=;i++)

            for(int j=w[i];j<=n;j++)

        {

            f[j]=f[j]+f[j-w[i]];

        }

        cout<<f[n]<<endl;

    }

    return ;

}