#include <bits/stdc++.h>
using namespace std;

#define SZ(a) (int)a.size()
#define ALL(a) a.begin(), a.end()
#define FOR(i, a, b) for (int i = (a); i<(b); ++i)
#define RFOR(i, b, a) for (int i = (b)-1; i>=(a); --i)
#define MP make_pair
#define PB push_back
#define F first
#define S second

typedef long long LL;
typedef pair<int, int> PII;
typedef vector<int> VI;

string s;
vector<pair<int, int>> edges[2];
int ptr;

void dfs(int i, int p) {
	while (s[ptr] == ' ') {
		ptr++;
		assert(ptr < SZ(s));
	}
	int v = 0;
	while (ptr < SZ(s) && isdigit(s[ptr])) {
		v = 10 * v + s[ptr++] - '0';
	}
	edges[i].emplace_back(v, p);
	while (true) {
		while (ptr < SZ(s) && s[ptr] == ' ') {
			ptr++;
		}
		if (ptr == SZ(s)) {
			return;
		}
		if (s[ptr] == '(') {
			ptr++;
			dfs(i, v);
			assert(s[ptr] == ')');
			ptr++;
		}
		else if (s[ptr] == ')') {
			return;
		}
	}
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	FOR(i, 0, 2) {
		getline(cin, s);
		ptr = 0;
		dfs(i, -1);
		sort(ALL(edges[i]));
	}
	cout << (edges[0] == edges[1] ? "Yes\n" : "No\n");
	return 0;
}