#include "bits/stdc++.h"
using namespace std;
#define fastio ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
#define vint vector<int>
#define int long long
#define nl '\n'

const int N = 1e6 + 5, MOD = 1e9 + 7;
int n, dp[N];

int sol(int sum){
    if (sum > n) return 0;
    if (sum == n) return 1;
    int &x = dp[sum];
    if(x != -1) return x;
    x = 0;
    for (int i = 1; i <= 6; i++)
        x = (x + sol(sum + i)) % MOD;

    return x; 
}


void solve() {
    cin>>n;
    memset(dp, -1, sizeof dp);
    cout<<sol(0);
}
 
int32_t main() {
    fastio
    int t = 1; //cin>>t;
    while (t--) solve();
    return 0;
}