#include <cstdio>
#include <algorithm>
#include <iostream>
using namespace std;
#define MOD 1000000007
typedef long long LL;
LL f[81][81] = {0},ans[81] = {0};
int main(){
    int n,m,i,j;
    for (i=1;i<=80;i++){
        f[i][0] = 0;
        f[i][1] = 1;
        f[i][i] = 1;
        f[0][i] = 0;
    }
    for (i=1;i<=80;i++){
        for (j=1;j<=i;j++){
            if (i == j) f[i][j] = 1;
            else 
                f[i][j] = (f[i-1][j-1] + f[i-j][j]) % MOD;
        }
    }
    for (i=1;i<=80;i++){
        ans[i] = f[i][1];
        for (j=2;j<=i-1;j++){
            ans[i] += f[i][j];
        }
    }
    while (scanf("%d",&n) != EOF){
        printf("%lld\n",ans[n]);
    }
    return 0;
}