#include <cstdio>
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
int fib[60];
void init()
{
	fib[1]=1;
	for(int i=2;i<40;++i)
		fib[i]=fib[i-1]+fib[i-2];
	//for(int i=0;i<40;++i)
		//printf("%d\n",fib[i]);
}
int main()
{
	init();
	int n;
	scanf("%d",&n);
	int p=lower_bound(fib,fib+40,n)-fib;
	if(fib[p]!=n)
		p-=1;
	int q=lower_bound(fib,fib+40,n)-fib;
	printf("%d\n%d\n",fib[p],fib[q]);
}