#include <bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,n) for(int i=0; i<(int)n; i++)
#define rep1(i,n) for(int i=1; i<(int)n; i++)
#define repa(i,a,n) for(int i=(a); i<(int)(n); i++)
#define all(vec) vec.begin(),vec.end()
#define COUT(x) cout<<(x)<<endl
#define YES(x) cout<<(x?"YES":"NO")<<endl
#define Yes(x) cout<<(x?"Yes":"No")<<endl
#define F first
#define S second
using vi = vector<int>;
using vs = vector<string>;
using vvi = vector<vi>;
using pii = pair<int, int>;
using vpii = vector<pii>;
const int dx[4] = {1, 0,-1, 0};
const int dy[4] = {0, 1, 0,-1};
int gcd(int a, int b){if(a%b == 0){return(b);}else{return(gcd(b, a%b));}}
int lcm(int a, int b){return a/gcd(a, b)*b;}
template <typename T> bool chmax(T &a,const T& b){if(a<b){a=b;return true;}return false;}
template <typename T> bool chmin(T &a,const T& b){if(a>b){a=b;return true;}return false;}
//cout << fixed << setprecision(15);
int N, M, K, H, W, X, Y;
string S,T;
const int INF = 1e18;
const int mod = 1e9+7;

vvi gr;
vector<bool> seen;
void dfs(int a){
    seen[a] = true;
    for(int i : gr[a]){
        if(seen[i]==false) dfs(i);
    }
    return;
}


signed main(){
    cin >> N;
    vi k1(N,0);
    vi k2(N,0);
    vi p(N,0);
    k1[0]=1;
    rep1(i,N){
        k1[i] = p[i-1];
        k2[i] = k1[i-1];
        p[i] = k1[i-1]+k2[i-1];
        p[i] %= mod;
    }
    COUT((k1[N-1]+k2[N-1]+p[N-1])%mod);
    return 0;
}