#include <iostream>
#include <string>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <vector>
#include <cmath>
#include <cstdlib>
#include <queue>
#include <stack>

using namespace std;

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define REPO(i, n) for(int i = 1;i <= n;i++)
#define ll long long
#define INF 1999999999
#define MINF -1999999999
#define INF64 1999999999999999999
#define ALL(n) n.begin(),n.end()
#define MOD 1000000007

ll dp[1100000][2][2],ans = 0;
int main() {
	dp[0][1][1] = 1;
	ll n; cin >> n;
	REP(i, n) {
		REP(j, 2) {
			REP(k, 2) {
				if (j == 1 or k == 1) {
					dp[i + 1][k][0] += dp[i][j][k];
					dp[i + 1][k][0] %= MOD;
				}
				if (k == 0) {
					dp[i + 1][0][1] += dp[i][j][0];
					dp[i + 1][0][1] %= MOD;
				}
			}
		}
	}
	REP(i, 2) {
		REP(j, 2) {
			ans += dp[n][i][j];
			ans %= MOD;
		}
	}
	cout << ans << endl;
}