# coding: utf-8
import sys
sys.setrecursionlimit(10 ** 9)
mod = 10 ** 9 + 7

N = int(input())
# 状態遷移 けん2回目→ぱ、けん1回目→けん2回目 or ぱ、ぱ→けん1回目

memo = [[0] * N for __ in range(3)]


def solve():
    if N == 1:
        return 1

    # state=0 ken2nd, state=1 ken1st, state=2 pa
    def move(state=1, now=2):
        global memo

        if now == N:
            if state == 0:
                return 1
            elif state == 1:
                return 2
            elif state == 2:
                return 1

        if memo[state][now] != 0:
            return memo[state][now]
        else:
            if state == 0:
                ret = move(2, now + 1)
            elif state == 1:
                ret = move(0, now + 1) + move(2, now + 1)
            elif state == 2:
                ret = move(1, now + 1)
            
            if ret >= mod:
                ret %= mod
            
            memo[state][now] = ret
            return ret

    return move()

print(solve() % (10 ** 9 + 7))