def kenpa(n): if n == 1: return [1,0,0,0] # 終わり方が,ケンケンパ,ケンパケン,パケンケン,パケンパの順にメモ elif n == 2: return [1,1,0,0] elif n == 3: return [1,1,0,0] else: pre = kenpa(3) for i in range(n-3): ans = [pre[2]%1000000007,(pre[0]+pre[3])%1000000007,pre[1]%1000000007,pre[1]%1000000007] pre = ans return pre N = int(input()) print(sum(kenpa(N))%(10**9+7))