import sys,random,bisect
from collections import deque,defaultdict
from heapq import heapify,heappop,heappush
from itertools import permutations
from math import gcd

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

mod = 10**9 + 7

N = 1000
dp = [0 for j in range(N+1)]
dp[0] = 1

for i in range(3,N+1):
    for j in range(N+1-i):
        dp[j+i] += dp[j]
        dp[j+i] %= mod

print(dp[int(input())])