#include <iostream>

using namespace std;
const int maxn = 1e6 + 5;
const int MOD = 1e9 + 7;
int n;
int dp[maxn];
int rec(int sum) {
    if(sum == 0) {
        return 1;
    }
    if(dp[sum] != -1) {
        return dp[sum];
    }
    int ret = 0;
    for(int i = 1; i <= 6; ++i) {
        if(sum - i >= 0) {
            ret += rec(sum - i);
            ret %= MOD;
        }
    }
    return dp[sum] = ret;
}
int main()
{
    cin >> n;
    for(int i = 0; i < maxn; ++i) {
        dp[i] = -1;
    }
    cout << rec(n) << endl;
    return 0;
}