#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> p64;
typedef vector<ll> v64;
typedef vector<v64> vv64;
typedef vector<p64> vp64;

unordered_set<ll> depts;

v64 tree1[1000005];
v64 tree2[1000005];
v64 *tree;
string str;
stringstream ss;

ll dfs() {
    ll dept;
    ss >> dept;
    depts.insert(dept);

    // cout << dept << endl;

    v64 children;
    char c;
    while (ss >> c) {
        // cout << c << endl;
        if (c == '(') {
            children.push_back(dfs());
        } else if (c == ')') {
            break;
        } else {
            assert(false);
        }
    }
    sort(children.begin(), children.end());
    tree[dept] = children;
    return dept;
}

int main() {
    depts.insert(0);

    getline(cin, str);
    ss = stringstream(str);
    tree = tree1;
    tree[0].push_back(dfs());

    getline(cin, str);
    ss = stringstream(str);
    tree = tree2;
    tree[0].push_back(dfs());

    for (ll dept : depts) {
        if (tree1[dept] != tree2[dept]) {
            cout << "No" << endl;
            return 0;
        }
    }
    cout << "Yes" << endl;

    return 0;
}