from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
# 0~9を並び替えるならpermutationsかconbinations,N列のカテゴリを作るにはproduct
from itertools import product, permutations, combinations, accumulate
from functools import lru_cache  # @lru_cache(maxsize=128)
import operator
from string import ascii_uppercase, ascii_lowercase, digits  # 英字(大文字), 英字(小文字), 数字
MOD = 10 ** 9 + 7
def II(): return int(input())
def LI(): return list(input())
def LMI(): return list(map(int, input().split()))
def LMS(): return list(map(str, input().split()))
def LLMI(x): return [list(map(int, input().split())) for _ in range(x)]
def LLMS(x): return [list(input()) for _ in range(x)]
  
def execute():
    n = II()
    dp = [[0] * 3 for _ in range(n)]
    dp[0][0] = 1
    for i in range(n-1):
        for k in range(3):        
            dp[i+1][(k+1)%3] += dp[i][k]
            dp[i+1][(k+1)%3] %= MOD
            if k == 0:
                dp[i+1][2] += dp[i][k]
                dp[i+1][2] %= MOD
            # else:
            #     dp[i+1][k] = dp[i][k]
    
    print(sum(dp[-1])%MOD)
    # print(dp)


if __name__ == "__main__":
    T = 1
    for _ in range(T):
        execute()