#include <iostream>


const int mod = (int)1e9 + 7;
long long dp[1000010][2];

long long solve(const int n) {
    dp[1][0] = 1;
    dp[1][1] = 0;
    dp[2][0] = 1;
    dp[2][1] = 1;

    for (int i = 3; i < n+1; i++) {
        dp[i][0] = (dp[i-1][1] + dp[i-2][1]) % mod;
        dp[i][1] = dp[i-1][0] % mod;
    }

    return dp[n][0] + dp[n][1];
}


int main(int argc, char const* argv[]) {
    int n;
    std::cin >> n;
    std::cout << solve(n) % mod << std::endl;
    return 0;
}