#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <vector>
#include <set>
#include <queue>
#include <map>
#include <iomanip>
using namespace std;
typedef long long LL;
const int maxn=1e6+10;
const int inf = 0x3f3f3f3f;
int num[maxn]={1,1},n;
int main()
{
	ios::sync_with_stdio(0);
	for(int i=2;i<30;++i)
		num[i]=num[i-1]+num[i-2];
	cin>>n;
	int i=upper_bound(num,num+30,n)-num;
	cout<<num[i-1]<<" ";
	cout<<*lower_bound(num,num+30,n)<<endl;
}