#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

const ll MOD = 1000000000ll + 7;
ll dp[1000100][3];

int main(){
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    int N;
    std::cin >> N;

    dp[0][0] = 1;
    for(int i=0;i<N;++i){
        dp[i + 1][1] = (dp[i + 1][1] + dp[i][0]) % MOD;
        dp[i + 1][2] = (dp[i + 1][2] + dp[i][1]) % MOD;
        dp[i + 1][0] = (dp[i + 1][0] + dp[i][1]) % MOD;
        dp[i + 1][0] = (dp[i + 1][0] + dp[i][2]) % MOD;
    }

    ll res = (dp[N][0] + dp[N][1] + dp[N][2]) % MOD;
    std::cout << res << std::endl;
}