#include<bits/stdc++.h>
using namespace std;
#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[8]={1,0,-1,0,1,1,-1,-1};
const ll dx[8]={0,-1,0,1,1,-1,1,-1};
template<class T> inline bool chmin(T& a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}


int main(){
    vector<ll> fa={1,0,1},fb={0,1,1};
    while(*fa.rbegin()<inf){
        ll p=fa[fa.size()-1]+fa[fa.size()-2];
        ll q=fb[fb.size()-1]+fb[fb.size()-2];
        fa.pb(p);fb.pb(q);
    }
    //rep(i,fa.size())cout << fa[i] <<" ";cout << endl;
    //rep(i,fa.size())cout << fb[i] <<" ";cout << endl;
    ll n=fa.size();
    vl v(3);rep(i,3)cin >> v[i];sort(all(v));
    ll x=v[0],y=v[2],z=v[1];
    if(x==y){
        if(x==1){
            cout << 1 <<" " << 1 <<endl;
            return 0;
        }
        ll A=1,B=inf;
        repl(i,2,n){
            ll p=x-fa[i];
            if(p<=0)continue;
            if(p%fb[i])continue;
            chmin(B,p/fb[i]);
        }
        cout << A <<" " << B <<endl;
        return 0;
    }
    set<pl> st;
    rep(i,n){
        repl(j,i+1,n){
            ll k=fb[i]*fa[j]-fa[i]*fb[j];
            ll l=fb[i]*y-fb[j]*x;
            //kA=lを解く
            if(l%k)continue;
            ll A=l/k;
            ll m=x-A*fa[i];
            //fbB=mを解く
            if(m<0)continue;
            ll B;
            if(m==0){
                m=y-A*fa[j];
                if(m%fb[j])continue;
                B=m/fb[j];
            }
            else{
                if(m%fb[i])continue;
                B=m/fb[i];
            }
            if(A<=0||B<=0)continue;
            rep(k,n){
                if(z==fa[k]*A+fb[k]*B){
                    st.ins({A,B});
                    //cout << A << " " << B <<endl;
                }
            }
        }
    }
    if(st.size())cout << st.begin()->fi <<" " << st.begin()->se <<endl;
    else cout << -1 <<endl;
}