#include<bits/stdc++.h>
using namespace std;
const int N = 1000005;
int tp,x,st[N],opp;
string s1,s2;
vector<int> e1[N],e2[N];
int main(){
    getline(cin,s1); getline(cin,s2); 
    for(char nw: s1){
        if(nw<='9'&&nw>='0'){x=x*10+nw-'0'; continue;}
        if(nw=='('){opp++; continue;}
        if(x && opp) e1[st[tp]].push_back(x),st[++tp] = x, x=0, opp--;
        else if(x) st[++tp] = x, e1[x].push_back(0), x=0;
        if(nw==')') tp--;
    }
    tp=0; st[tp]=0; x=0;
    for(char nw: s2){
        if(nw<='9'&&nw>='0'){x=x*10+nw-'0'; continue;}
        if(nw=='('){opp++; continue;}
        if(x && opp) e2[st[tp]].push_back(x),st[++tp] = x, x=0, opp--;
        else if(x) st[++tp] = x, e2[x].push_back(0), x=0;
        if(nw==')') tp--;
    }
    // for(int i=1;i<=100000;i++){
    //     if(e1[i].size()==0) continue; sort(e1[i].begin(), e1[i].end()); 
    //     cout<<i<<": "; for(int j=0;j<e1[i].size();j++) cout<<e1[i][j]<<" "; cout<<endl;
    // }
    // for(int i=1;i<=100000;i++){
    //     if(e2[i].size()==0) continue; sort(e2[i].begin(), e2[i].end());
    //     cout<<i<<": "; for(int j=0;j<e2[i].size();j++) cout<<e2[i][j]<<" "; cout<<endl;
    // }
    for(int i=1;i<=1000000;i++){
        if(e1[i].size()!=e2[i].size()){cout<<"No"; return 0;}
        sort(e1[i].begin(), e1[i].end()); sort(e2[i].begin(), e2[i].end());
        for(int j=0;j<e1[i].size();j++) if(e1[i][j]!=e2[i][j]){cout<<"No"; return 0;}
    }
    cout<<"Yes";
    return 0;
}