# ZeroJudge - d389: 11069 - A Graph Problem
### 題目連結：https://zerojudge.tw/ShowProblem?problemid=d389
###### tags: `ZeroJudge` `動態規劃（Dynamic Programming）`

#include <iostream>
using namespace std;

int DP[77] = { 1, 1, 2 }, nodes;

void Initialize() {
	for (int i = 3; i <= 76; ++i)
		DP[i] = DP[i - 2] + DP[i - 3];
}

int main() {
	cin.sync_with_stdio(false); cin.tie(nullptr);
	Initialize();
	while (cin >> nodes)
		cout << DP[nodes] << '\n';
}