#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef unsigned long long int ull;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
ll myRand(ll B) {
    return (ull)rng() % B;
}
inline double time() {
    return static_cast<long double>(chrono::duration_cast<chrono::nanoseconds>(chrono::steady_clock::now().time_since_epoch()).count()) * 1e-9;
}

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    string s,t;
    getline(cin, s);
    getline(cin, t);

    map<pair<int,vector<int>>,int> mp;

    auto id = [&](int par, vector<int> &v) -> int {
        if (mp.find({par, v}) == mp.end()) {
            int sz = mp.size();
            mp[{par, v}] = sz;
        }
        return mp[{par, v}];
    };

    auto slv = [&](auto slv, string &s, int &idx) -> int {
        int cur = 0;
        vector<int> v;
        while (idx < s.size()) {
            if (s[idx] == ' ') {
                idx += 1;
            }
            else if (isdigit(s[idx])) {
                cur = cur*10 + s[idx]-'0';
                idx += 1;
            }
            else if (s[idx] == '(') {
                idx += 1;
                v.push_back(slv(slv, s, idx));
                assert(s[idx] == ')');
                idx += 1;
            }
            else {
                break;
            }
        }
        sort(v.begin(), v.end());
        return id(cur, v);
    };

    int ii = 0, iii = 0;
    if (slv(slv, s, ii) == slv(slv, t, iii)) {
        cout << "Yes" << endl;
    }
    else {
        cout << "No" << endl;
    }
}