#include "bits/stdc++.h"

#define REP(i,n) for(ll i=0;i<n;++i)
#define RREP(i,n) for(ll i=n-1;i>=0;--i)
#define FOR(i,m,n) for(ll i=m;i<n;++i)
#define RFOR(i,m,n) for(ll i=n-1;i>=m;--i)
#define ALL(v) (v).begin(),(v).end()
#define PB(a) push_back(a)
#define UNIQUE(v) v.erase(unique(ALL(v)),v.end());
#define DUMP(v) REP(aa, (v).size()) { cout << v[aa]; if (aa != v.size() - 1)cout << " "; else cout << endl; }
#define INF 1000000001ll
#define MOD 1000000007ll
#define EPS 1e-9

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


using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<vi> vvi;
typedef vector<vl> vvl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
ll max(ll a, int b) { return max(a, ll(b)); }
ll max(int a, ll b) { return max(ll(a), b); }
ll min(ll a, int b) { return min(a, ll(b)); }
ll min(int a, ll b) { return min(ll(a), b); }
///(´・ω・`)(´・ω・`)(´・ω・`)(´・ω・`)(´・ω・`)(´・ω・`)///
int n;
int dfs(vvl &dp, int i,int p) {
	if (i == 0)return dp[i][p]=1;
	if (dp[i][p] != -1)return dp[i][p];
	dp[i][p] = 0;
	REP(j, 3) {
		if (j != p&&i>=j+1) {
			dp[i][p] += dfs(dp, i - j - 1, j);
			dp[i][p] %= MOD;
		}
	}
	return dp[i][p];
}

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

	cin >> n;
	vvl dp(n+1,vl(3,-1));
	REP(i, 3)dfs(dp, n, i);
	cout << (((dp[n][0]+dp[n][1])%MOD+dp[n][2])%MOD*(MOD+1)/2)%MOD << endl;
}