#include <bits/stdc++.h>
using namespace std;

#define REP(i, m, n) for (int i = (m); i < (int)(n); i++)
#define REPS(i, m, n) for (int i = (m); i <= (int)(n); i++)
#define rep(i, n) REP(i, 0, n)
#define reps(i, n) for (int i = 0; i <= (int)(n); i++)
#define rrep(i, x) for (int i = ((int)(x)-1); i >= 0; i--)
#define rreps(i, x) for (int i = (int)(x); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define fi first
#define se second
typedef long long ll;
typedef pair<int, int> P;
const int inf = INT_MAX;
const ll INF = 1LL << 60;
const ll mod = 1e9 + 7;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
template<typename A, size_t N, typename T> void Fill(A (&array)[N], const T &val) { fill( (T*)array, (T*)(array+N), val ); }

ll dp[1000010][3];
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int n; cin >> n;
    dp[0][0] = 1;
    rep(i, n) {
        rep(j, 3) {
            if (j == 0) {
                dp[i+1][1] += dp[i][0];
                dp[i+1][1] %= mod;
            } else if (j == 1) {
                dp[i+1][0] += dp[i][1];
                dp[i+1][0] %= mod;
                dp[i+1][2] += dp[i][1];
                dp[i+1][2] %= mod;
            } else if (j == 2) {
                dp[i+1][0] += dp[i][2];
                dp[i+1][0] %= mod;
            }
        }
    }
    ll ans = 0;
    rep(i, 3) {
        ans += dp[n][i];
        ans %= mod;
    }
    cout << ans << endl;
    return 0;
}