Two relay teams are racing to deliver an identical secret message across a canyon using a hand-off system. Each team splits its copy of the message into an ordered list of text segments before the race begins, and each runner on the team carries exactly one segment to the next hand-off point, in order. At the finish line, splicing a team's segments together in the order they were carried reconstructs whatever message that team actually delivered. Given the segment lists carried by Team A and Team B, determine whether the two teams delivered the exact same final message.

Input format

• Line 1: an integer n1, the number of segments Team A carries.
• Line 2: n1 space-separated strings, Team A's segments in the order they are spliced.
• Line 3: an integer n2, the number of segments Team B carries.
• Line 4: n2 space-separated strings, Team B's segments in the order they are spliced.

Output format

Print exactly one line: true if concatenating Team A's segments in order produces the exact same string as concatenating Team B's segments in order, or false otherwise.

Constraints

• 1 <= n1, n2 <= 100
• 1 <= length of each segment <= 20
• Each segment consists only of lowercase English letters.
• The total length of all segments within a single team's list does not exceed 1000.

3
ab c de
2
abc de

true

2
a cb
2
ab c

false