#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <numeric>
#include <regex>
#include <tuple>
#include<iomanip>
using namespace std;

typedef long long ll;
typedef pair<int, int> P;
#define MOD 1000000007 // 10^9 + 7
#define INF 1000000000 // 10^9
#define LLINF 1LL<<60

ll pa[1000001];         // n回目がpaとなるような総数
ll firstKen[1000001];   // n回目が初めてのkenとなるような総数
ll secondKen[1000001];


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

	int N; cin >> N;
	pa[1] = 0;
	firstKen[1] = 1;
	secondKen[1] = 0;

	for (int i = 2; i <= N; i++) {
		pa[i] = (firstKen[i - 1] + secondKen[i - 1]);
		pa[i] %= MOD;

		firstKen[i] = pa[i - 1];
		firstKen[i] %= MOD;

		secondKen[i] = firstKen[i - 1];
		secondKen[i] %= MOD;
	}

	cout << (pa[N] + firstKen[N] + secondKen[N]) % MOD << endl;

	return 0;
}