// fib2 is defined by fib2(n) = fib2(n-1) + 2*fib2(n-2);  and when n = 0 or 1 fib2(n) is 1.

double fib2(double n)
{	if (n < 2) return 1;
	else return fib2(n-1) + 2*fib2(n-2);
}

#include <iostream>
using namespace std;

int main()
{
	int n;
	while (cin >> n) cout << n << " " << fib2(n) << endl; 
}