//#include <bits/stdc++.h>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <iomanip>
#include <numeric>
#include <cmath>
#include <cstdint>

#define rep(i,n) for(int i = 0; i < n; i++) //[0,n)
#define srep(i,a,b) for(int i = a; i < b; i++) //[a,b)
#define arep(i,a,b,d) for(int i = a; i < b; i += d)
#define all(A) (A).begin(),(A).end()
#define rall(A) (A).rbegin(),(A).rend()
#define pmt(A) next_permutation(all(A))
using namespace std;
using ll = long long;
using ull = unsigned long long;
using pq = priority_queue<ll,vector<ll>,greater<ll>>;
const ll inf = 1LL<<60;
const int iinf = (int)1e9+1;
const int mod9 = 998244353;
const int mod1 = (int)1e9+7;
struct Edge { int to; long long cost; int from; };
bool compe(const Edge &e,const Edge &e2){ return e.cost < e2.cost; }
using Graph = vector<vector<int>>;
using SGraph = vector<set<ll>>;
template <class T>
int siz(T& a){return (int)a.size();}
ll squa(ll a){ return a*a; }
double torad(double x){ return x*(acos(-1)/180.0); }
ll cross(ll ax,ll ay,ll bx,ll by){ return ax*by-ay*bx; }
ll mceil(ll a,ll b){ return (a+b-1)/b; }

ll dp[1010101][4];
int main(){
    int N; cin >> N;

    rep(i,N) rep(j,3) dp[i][j] = 0;
    
    dp[1][1] = 1;
    srep(i,1,N){
        rep(j,3){
            if(j == 0) (dp[i+1][1] += dp[i][0]) %= mod1;
            else if(j == 1){
                dp[i+1][2] += dp[i][1];
                dp[i+1][0] += dp[i][1];
                dp[i+1][2] %= mod1;
                dp[i+1][0] %= mod1;
            }
            else (dp[i+1][0] += dp[i][2]) %= mod1;
        }
    }

    ll ans = 0;
    rep(i,3) (ans += dp[N][i]) %= mod1;

    cout << ans;
}