#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;
}
I2luY2x1ZGUgImJpdHMvc3RkYysrLmgiCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiNkZWZpbmUgZmFzdGlvIGlvc19iYXNlOjpzeW5jX3dpdGhfc3RkaW8oMCk7IGNpbi50aWUoTlVMTCk7IGNvdXQudGllKE5VTEwpOwojZGVmaW5lIHZpbnQgdmVjdG9yPGludD4KI2RlZmluZSBpbnQgbG9uZyBsb25nCiNkZWZpbmUgbmwgJ1xuJwoKY29uc3QgaW50IE4gPSAxZTYgKyA1LCBNT0QgPSAxZTkgKyA3OwppbnQgbiwgZHBbTl07CgppbnQgc29sKGludCBzdW0pewogICAgaWYgKHN1bSA+IG4pIHJldHVybiAwOwogICAgaWYgKHN1bSA9PSBuKSByZXR1cm4gMTsKICAgIGludCAmeCA9IGRwW3N1bV07CiAgICBpZih4ICE9IC0xKSByZXR1cm4geDsKICAgIHggPSAwOwogICAgZm9yIChpbnQgaSA9IDE7IGkgPD0gNjsgaSsrKQogICAgICAgIHggPSAoeCArIHNvbChzdW0gKyBpKSkgJSBNT0Q7CgogICAgcmV0dXJuIHg7IAp9CgoKdm9pZCBzb2x2ZSgpIHsKICAgIGNpbj4+bjsKICAgIG1lbXNldChkcCwgLTEsIHNpemVvZiBkcCk7CiAgICBjb3V0PDxzb2woMCk7Cn0KIAppbnQzMl90IG1haW4oKSB7CiAgICBmYXN0aW8KICAgIGludCB0ID0gMTsgLy9jaW4+PnQ7CiAgICB3aGlsZSAodC0tKSBzb2x2ZSgpOwogICAgcmV0dXJuIDA7Cn0=