// (X|Y)Z = φ_X (Y) + Z
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <array>
#include <memory>
#include <atcoder/modint>

using namespace std;
using i32 = int32_t;
using u32 = uint32_t;
using i64 = int64_t;
using u64 = uint64_t;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
const i64 INF = 1001001001001001001;

using Modint = atcoder::static_modint<998244353>;


struct Ordinal {
    shared_ptr<const struct OrdinalCore> p;
    Ordinal() : p(nullptr) {}
    Ordinal(Ordinal phisuf, Ordinal phiarg, Ordinal plus);
    const struct OrdinalCore* operator->() const { return p.get(); }
    static Ordinal Zero(){ return Ordinal(); }
    static Ordinal One(){ return Ordinal(Zero(), Zero(), Zero()); }
    bool isZero(){ return !p; }
};

struct OrdinalCore {
    Ordinal phisuf;
    Ordinal phiarg;
    Ordinal plus;
    OrdinalCore(Ordinal _phisuf, Ordinal _phiarg, Ordinal _plus)
        : phisuf(_phisuf)
        , phiarg(_phiarg)
        , plus(_plus) {}
};

Ordinal::Ordinal(Ordinal phisuf, Ordinal phiarg, Ordinal plus)
    : p(std::make_shared<OrdinalCore>(phisuf, phiarg, plus)) {}

Ordinal construct(string s, int& p){
    if(p == (int)s.size()) return Ordinal::Zero();
    if(s[p] != '(') return Ordinal::Zero();
    Ordinal phisuf = construct(s, ++p);
    Ordinal phiarg = construct(s, ++p);
    Ordinal plus = construct(s, ++p);
    return Ordinal(phisuf, phiarg, plus);
}


bool operator<(Ordinal l, Ordinal r){
    if(r.isZero()) return false;
    if(l.isZero()) return true;
    auto ltp = [](pair<Ordinal, Ordinal> l, pair<Ordinal, Ordinal> r) -> bool {
        if(l.first < r.first){
            return l.second < Ordinal(r.first, r.second, Ordinal::Zero());
        }
        if(r.first < l.first){
            return Ordinal(l.first, l.second, Ordinal::Zero()) < r.second;
        }
        return l.second < r.second;
    };
    vector<pair<Ordinal, Ordinal>> L, R;
    rep(x,2){
        while(!l.isZero()){
            auto nx = make_pair(l->phisuf, l->phiarg);
            while(L.size() && ltp(L.back(), nx)) L.pop_back();
            L.push_back(nx);
            l = l->plus;
        }
        swap(l,r); swap(L,R);
    }
    return lexicographical_compare(L.begin(), L.end(), R.begin(), R.end(), ltp);
}


int main(){
    string T0, T1; cin >> T0 >> T1;
    int p0 = 0, p1 = 0;
    auto t0 = construct(T0, p0);
    auto t1 = construct(T1, p1);
    if(t1 < t0) cout << "0\n"; else cout << "1\n";
    return 0;
}