import sys

# sys.setrecursionlimit(200005)
int1 = lambda x: int(x)-1
pDB = lambda *x: print(*x, end="\n", file=sys.stderr)
p2D = lambda x: print(*x, sep="\n", end="\n\n", file=sys.stderr)
def II(): return int(sys.stdin.readline())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def LI1(): return list(map(int1, sys.stdin.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def SI(): return sys.stdin.readline().rstrip()
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0), (1, 1), (1, -1), (-1, 1), (-1, -1)]
inf = (1 << 63)-1
# inf = (1 << 31)-1
md = 10**9+7
# md = 998244353

n = II()

if n<3:
    print(0)
    exit()

dp = [[0]*(n+1) for _ in range(n+1)]

dp[3][1] = 1

for i in range(3,n):
    for j in range(1,n+1):
        pre = dp[i][j]
        if pre == 0: continue
        if i+3<=n:
            dp[i+3][j+1] += pre
            dp[i+3][j+1] %= md
        if i+j <= n:
            dp[i+j][j] += pre
            dp[i+j][j] %= md

ans = 0
for j in range(1,n+1):
    ans += dp[n][j]
    ans %= md

print(ans)