#include <bits/stdc++.h>
using namespace std;
typedef vector<int> vi;

int getNum(string& S, int& idx) {
    int num = 0;
    while(idx < (int) S.length() && S[idx] >= '0' && S[idx] <= '9') {
        num *= 10;
        num += S[idx++] - '0';
    }
    return num;
}

unordered_map<int, int> getHierarchy(string& S) {
    unordered_map<int, int> parent;
    int idx = 0;
    int bigBoss = getNum(S, idx);
    parent[bigBoss] = -1;
    stack<int> s;
    s.push(bigBoss);
    while(idx < (int) S.length()) {
        if(S[idx] ==  ' ' || S[idx] == '(') {
            idx++;
            continue;
        }
        if(S[idx] == ')') {
            idx++;
            s.pop();
            continue;
        }
        int next = getNum(S, idx);
        parent[next] = s.top();
        s.push(next);
    }
    return parent;
}

void solve() {
    string S1, S2;
    getline(cin, S1);
    getline(cin, S2);
    unordered_map<int, int> p1 = getHierarchy(S1);
    unordered_map<int, int> p2 = getHierarchy(S2);
    if(p1.size() != p1.size()) {
        cout << "No" << '\n';
        return;
    }
    for(auto[u, parent] : p1) {
        if(p2.find(u) == p2.end() || p2[u] != parent) {
            cout << "No" << "\n";
            return;
        }
    }
    cout << "Yes" << "\n";
}

int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int T = 1;
    // cin >> T;
    while(T--) {
        solve();
    }
    return 0;
}