# Live as if you were to die tomorrow.
# Learn as if you were to live forever.
MOD = 10 ** 9 + 7


def solve():
    # dp[i][0] means that i-th one ended in "first ken".
    # dp[i][1] means that i-th one ended in "second ken".
    # dp[i][2] means that i-th one ended in "pa".
    dp = [[0, 0, 0] for _ in range(10 ** 6 + 1)]
    dp[1][0] = 1

    for i in range(2, 10 ** 6 + 1):
        dp[i][0] += dp[i - 1][2]
        dp[i][0] %= MOD
        dp[i][1] += dp[i - 1][0]
        dp[i][1] %= MOD
        dp[i][2] += dp[i - 1][0] + dp[i - 1][1]
        dp[i][2] %= MOD
    return dp


def main():
    N = int(input())

    dp = solve()
    print(sum(dp[N]) % MOD)


if __name__ == "__main__":
    main()