UVa 11069 - A Graph Problem

// UVa 11069 - A Graph Problem

#include <iostream>
using namespace std;

#define datatype int

int main() {

	datatype T[77];
	T[1] = 1;
	T[2] = 2;
	T[3] = 2;
	for (int n = 4; n <= 76; n++)
		T[n] = T[n - 2] + T[n - 3];

	int n;
	while (cin >> n)
		cout << T[n] << endl;

	return 0;
}