#include "bits/stdc++.h"
#define REP(i,n,N) for(int i=(n); i<(N); i++)
#define RREP(i,n,N) for(int i=(N-1); i>=n; i--)
#define CK(n,a,b) ((a)<=(n)&&(n)<(b))
#define ALL(v) (v).begin(),(v).end()
#define p(s) cout<<(s)<<endl
#define p2(a,b) cout<<(a)<<" "<<(b)<<endl
#define v2(T) vector<vector<T>>
typedef long long ll;
using namespace std;
const ll mod=1e9+7;

int N;
ll dp[1000010][3];
int main() {
    cin>>N;
    dp[0][0]=1;
    dp[1][0]=dp[2][1]=dp[3][2]=1;
    REP(i,1,N){
        REP(j,0,3){
            dp[i+(j+1)%3+1][(j+1)%3] += dp[i][j];
            dp[i+(j+1)%3+1][(j+1)%3] %= mod;
            dp[i+(j+2)%3+1][(j+2)%3] += dp[i][j];
            dp[i+(j+2)%3+1][(j+2)%3] %= mod;
        }
    }
    p((dp[N][0]+dp[N][1]+dp[N][2]) % mod);
    return 0;
}