#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
 
using namespace std;
using namespace __gnu_pbds;
typedef long long int lld;
typedef tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update> ordered_set;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define trav(a,v) for(auto a:v)
//lld fib[100];
//const int MX=40;
void solve(){
	lld N;
	cin>>N;
	pair<lld,lld> ans={N,0};
	rep(i,0,N+1){
		pair<lld,lld> seq={N,i};
		while(seq.first>=seq.second){
			pair<lld,lld> nx={seq.second,seq.first-seq.second};
			seq=nx;
		}
		pair<lld,lld> S={seq.first+seq.second,seq.second};
		if(seq.first==0)S.second=0;
		ans=min(ans,S);
	}
	cout<<ans.second<<" "<<ans.first-ans.second<<"\n";
}

int main(){
	//fib[0]=0;
	//fib[1]=1;
	//rep(i,2,MX)fib[i]=fib[i-1]+fib[i-2];
	//cout<<fib[MX-1]<<"\n";
	ios::sync_with_stdio(0);
	cin.tie(0);
	int tt=1;
	//cin>>tt;
	while(tt--){
		solve();
	}
}