#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N=;

int n,tot,mark[N],pri[N];

ll ans,f[N][N];

int main()

{

    scanf("%d",&n);

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

     {

        if (!mark[i])pri[++tot]=i;

        for (int j=;j<=tot&&i*pri[j]<=;j++)

         {

            mark[i*pri[j]]=;

            if (i%pri[j]==)break;

         }

     }

    f[][]=;

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

     {

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

        for (int j=pri[i];j<=n;j*=pri[i])

         for (int k=;k<=n-j;k++)f[i][k+j]+=f[i-][k];

     }

    for (int i=;i<=n;i++)ans+=f[tot][i];

    printf("%lld",ans);

    return ;

}