#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <algorithm>
#include <sstream>
#include <map>
#include <set>

#define REP(i,k,n) for(int i=k;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
#define INF 1<<30
#define pb push_back
#define mp make_pair

using namespace std;
typedef long long ll;
typedef pair<int,int> P;

int main() {
    string sa,sb,pa,pb,xa,xb;
    cin >> sa >> pa >> xa;
    cin >> sb >> pb >> xb;

    while(pa.size() > 1 && pa[0] == '0') {
        pa = pa.substr(1,pa.size()-1);
    }

    while(pb.size() > 1 && pb[0] == '0') {
        pb = pb.substr(1,pb.size()-1);
    }

    if(pa == pb) cout << -1 << endl;
    else if(pa > pb) cout << sa << endl;
    else cout << sb << endl;

    return 0;
}