#include <iostream>
#include <iomanip>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include<set>
#include<cstring>
#include <stack>
#include <sstream>

using namespace std;
typedef long long ll;

int main(){
    vector<vector<int>> parents(2);    
    for(int i = 0; i < 2; i++){
        vector<int> nv(1000001, -2); parents[i] = nv; // ADD CHECK FOR DEPARTMENTAL HEIRARCHY BEING THE ONLY ONE SEEN
    }

    char c;
    
    //int curr_list = 0;

    for (int curr_list = 0; curr_list < 2; curr_list++) {
        stack<string> prev_stack;
        string curr_num = "";
        string s;
        getline(cin, s);
        //cout << s << endl;
        bool paren = false;
        for (int j = 0; j < s.size(); j++) {
            c = s[j];
            // if(c == '\n'){
            //     if(parents[curr_list][stoi(curr_num)] == -2){
            //         parents[curr_list][stoi(curr_num)] = -1;
            //     }
            //     curr_list++;
            // } else
            if (c == '(') {
                prev_stack.push(curr_num);
                curr_num = "";
                paren = true;
            } else if (c == ')') {
                if (prev_stack.empty()) cout << "EMPTY!" << endl;
                string parent = prev_stack.top();
                prev_stack.pop();
                parents[curr_list][stoi(curr_num)] = stoi(parent);
                curr_num = parent;
            } else if (c != ' ') {
                curr_num += c;
            }
        }
        if (!paren) {
            parents[curr_list][stoi(curr_num)] = stoi(curr_num);
        }
    }
    

    for(int i = 0; i < 1000001; i++){
        if(parents[0][i] != parents[1][i]){
            cout << "No" << endl;
            //cout << "No, " << i << " has parent " << parents[0][i] << " vs " << parents[1][i] << endl;
            return 0;
        }
    }

    cout << "Yes" << endl;
    return 0;
}