import java.io.*;
import java.util.*;

public class tcbo {

	public static void main(String args[]) throws Exception {

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter pw = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));
		
		HashMap<Integer, TreeSet<Integer>> a = createTree(br);
		HashMap<Integer, TreeSet<Integer>> b = createTree(br);
		
		//System.out.println(a);
		//System.out.println(b);
		
		if(a.equals(b))
			pw.println("Yes");
		else
			pw.println("No");
		
		pw.close();
	}
	
	static HashMap<Integer, TreeSet<Integer>> createTree(BufferedReader br) throws IOException{
		Stack<Integer> stack = new Stack<Integer>();		
		HashMap<Integer, TreeSet<Integer>> tree = new HashMap<>();
		
		String[] line = br.readLine().split(" ");
		
		Queue<Character> clist = new LinkedList<Character>();
				
		for(String s : line)
			s.chars().forEach(c -> clist.add((char) c));		
				
		while(!clist.isEmpty()) {
			if(Character.isDigit(clist.peek())) {
				int num = clist.poll()-'0';
				
				while(Character.isDigit(clist.peek())) {
					num *= 10;
					num += clist.poll()-'0';
				}
				
				if(!stack.isEmpty()) {
					tree.putIfAbsent(stack.peek(), new TreeSet<Integer>());
					tree.get(stack.peek()).add(num);
				}
				
				stack.push(num);
			}else {
				if(clist.poll().charValue() == ')')
					stack.pop();
			}
		}
		
		return tree;
	}
}