#include <bits/stdc++.h>
using namespace std;

struct State {
	long long split = 0, full = 0;
};

int main() {
	int n;
	cin >> n;
	vector<State> dp(n + 1);

	dp[0].full = 1;

	for (int i = 1; i < n + 1; ++i) {
		dp[i].full += dp[i - 1].full;
		dp[i].split += dp[i - 1].split;
		dp[i].full += dp[i - 1].split;
		if (i >= 2) {
			dp[i].full += dp[i - 2].full;
			dp[i].split += dp[i - 2].full * 2; 
		}
	}

	cout << dp[n].full << endl;
}