Problem K
Two Charts Become One

When businesses feel that they are a little bloated and in need of restructuring, they call in the well-known reorganization consultant Don Sizing. One of the first things Don asks for is a chart showing the hierarchy of departments in the business, i.e., which departments are in charge of other departments. Often there will be some confusion about this hierarchy and Don will end up with two or more different charts displaying the same set of departments. In situations like this Don must determine if the charts are similar, i.e., if they show the exact set of hierarchies while not necessarily being drawn the same way. For example, consider the two charts shown on the left in Figure 1. While they do not look the same, they do represent the same hierarchies – department $11$ is in charge of departments $10$ and $12$ and department $12$ is in charge of departments $13$, $17$ and $28$. The three charts on the right in Figure 1 are all truly different, each representing different hierarchies.

Figure 1: Two sets of hierarchical charts.

For companies with small numbers of departments, determining whether two charts are the same is relatively simple, but for larger companies it can be rather difficult. Don has sized up this problem and decided he needs some software to solve this problem for him.

Input

Input consists of two lines, each representing one hierarchical chart. The syntax for a hierarchical chart is the following:

1. a department number d by itself is a hierarchical chart

2. the string d (c1) (c2) ... (cn) is a hierarchical chart, where d is a department number and c1, c2, ..., cn are hierarchical charts.

Case 2 represents the case where department d is in charge of the departments at the top of the hierarchies c1, c2, ..., cn. Each input line will contain at most $100\, 000$ departments and no department will be in charge of more than $100$ other departments. All department numbers are integers between $1$ and $1\, 000\, 000$. We say that a hierarchical chart described by case 1 has leadership depth $1$, and a hierarchical chart described by case 2 has leadership depth equal to one plus the maximum leadership depth of the hierarchical charts c1, c2, …, cn. The input will have a leadership depth at most $1\, 000$. There may be any number of spaces on either side of an opening or closing parenthesis.

Output

Output Yes if the two hierachical charts are similar and No otherwise.

11 (10) (12 (13) (17) (28))
11 (12 (17) (28) (13)) (10)

Yes

11 ( 10 ) ( 12 )
11(10(12))

No

11 (10) (12)
11 (10) (13)

No