import java.util.*;
import java.io.*;

public class Main {

    public static int cal(int n)
    {
        int c1[]=new int [n+1];
        int c2[]=new int [n+1];
        for(int i=0;i<=n;i++)
        {
            c1[i]=1;
            c2[i]=0;
        }
        for(int i=2;i<=n;i++)
        {
            for(int j=0;j<=n;j++)
                for(int k=0;k+j<=n;k+=i)
                    c2[j+k]+=c1[j];
            for(int j=0;j<=n;j++)
            {
                c1[j]=c2[j];
                c2[j]=0;
            }
        }
        return c1[n];
    }
    public static void main(String[] args) {
        Scanner in=new Scanner(System.in);
        int n;
        while(in.hasNext())
        {
            n=in.nextInt();
            System.out.println(cal(n));
        }
    }

}

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;

int dp[150][150];

int main()
{
    int n,m;
        //dp[1][1]=1;
        for(int i=1; i<=150; i++)
            for(int j=1; j<=150; j++)
            {
                if(j==1)
                    dp[i][j]=1;
                else if(i==j)
                    dp[i][j]=dp[i][j-1]+1;
                else if(i>j)
                    dp[i][j]=dp[i][j-1]+dp[i-j][j];
                else if(i<j)
                    dp[i][j]=dp[i][i];
            }
        while(scanf("%d",&n)!=EOF)
        {
            printf("%d\n",dp[n][n]);
        }


    return 0;
}