#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000002


int main(){	
	
	vector<long long> x(3);
	rep(i,3)cin>>x[i];
	
	sort(x.begin(),x.end());
	
	
	
	vector<long long> A(2,0),B(2,0);
	A[0] = 1;
	B[1] = 1;
	
	while(A.back()<Inf&&B.back()<Inf){
		int n = A.size();
		A.push_back(A[n-1]+A[n-2]);
		B.push_back(B[n-1]+B[n-2]);
	}
	vector<pair<long long,long long>> ans;
	if(x[0]==x[2]){
		ans.emplace_back(1,x[0]);
		rep(i,A.size()){
			long long t = x[0] - A[i];
			if(t<=0)break;
			if(i<=1)continue;
			if(t%B[i]!=0)continue;
			ans.emplace_back(1,t/B[i]);
		}
	
	}
	else{
		if(x[0]==x[1])swap(x[1],x[2]);
		
		rep(i,A.size()){
			for(int j=i+1;j<A.size();j++){
				long long xa = A[i],ya = B[i],za = x[0];
				long long xb = A[j],yb = B[j],zb = x[1];
				long long xx,yy;
				if(xa!=0&&xb!=0){
					long long l = lcm(xa,xb);
					za *= l/xa;
					ya *= l/xa;
					zb *= l/xb;
					yb *= l/xb;
					if((za-zb)%(ya-yb)!=0)continue;
					yy = (za-zb)/(ya-yb);
					if(yy<=0)continue;
					xa=  A[i],ya = B[i],za = x[0];
					za -= ya * yy;
					if(za % xa != 0)continue;
					xx = za/xa;
					if(xx<=0)continue;
				}
				else continue;
				
				rep(k,A.size()){
					
					if(xx * A[k] + yy * B[k] == x[2]){
						ans.emplace_back(xx,yy);
						
					}
					
				}
			}
		}
		rep(i,A.size()){
			rep(j,i){
				long long xa = A[i],ya = B[i],za = x[0];
				long long xb = A[j],yb = B[j],zb = x[1];
				long long xx,yy;
				if(xa!=0&&xb!=0){
					long long l = lcm(xa,xb);
					za *= l/xa;
					ya *= l/xa;
					zb *= l/xb;
					yb *= l/xb;
					if((za-zb)%(ya-yb)!=0)continue;
					yy = (za-zb)/(ya-yb);
					if(yy<=0)continue;
					xa=  A[i],ya = B[i],za = x[0];
					za -= ya * yy;
					if(za % xa != 0)continue;
					xx = za/xa;
					if(xx<=0)continue;
				}
				else continue;
				
				rep(k,A.size()){
					
					if(xx * A[k] + yy * B[k] == x[2]){
						ans.emplace_back(xx,yy);
						
					}
					
				}
			}
		}
	}
	if(ans.size()==0)cout<<-1<<endl;
	else{
		sort(ans.begin(),ans.end());
		cout<<ans[0].first<<' '<<ans[0].second<<endl;
	}
	
	return 0;
	
}