An alchemist builds a potion using a blending tree. Every leaf of the tree is a single named ingredient, written as one lowercase letter a-z. Every internal node is a blender: it always has exactly two children, and it simply pours the two children's contents together, so its output amount is the sum of its left child's amount and its right child's amount. Because pouring together is symmetric and doesn't care about grouping, the only thing that determines a blending tree's total potency, for a fixed potency value assigned to each ingredient letter, is how many times each letter appears among the tree's leaves.

The same ingredient letter may appear at more than one leaf of a tree (meaning that ingredient gets poured in more than once), and different trees may use completely different shapes to combine the same ingredients.

Two blending trees are called equivalent if, for every possible way of assigning a positive potency value to each of the 26 ingredient letters, the two trees always yield exactly the same total potency. Given two blending trees, decide whether they are equivalent.

Each tree is described as a sequence of tokens listed in preorder (a node's token comes before its children's tokens). A token is either the uppercase letter B, meaning "this is a blender node — its left subtree's tokens come next, followed immediately by its right subtree's tokens", or a single lowercase letter, meaning "this is a leaf holding that ingredient". Every B token is followed, in the token stream, by exactly two complete subtrees, so the token list unambiguously reconstructs one full binary tree per input tree.

Input format

Four lines:

• Line 1: an integer n1, the number of tokens describing the first tree.
• Line 2: n1 space-separated tokens (each either B or a single lowercase letter), the preorder token list of the first tree.
• Line 3: an integer n2, the number of tokens describing the second tree.
• Line 4: n2 space-separated tokens, the preorder token list of the second tree.

Output format

Print EQUIVALENT if the two trees yield the same total potency for every possible assignment of potency values to the 26 ingredient letters, otherwise print NOT EQUIVALENT.

Constraints

• 1 <= n1, n2 <= 199.
• Each token list is a valid preorder encoding of a full binary tree (every B has exactly two children); consequently n1 and n2 are always odd.
• Every leaf token is a lowercase letter a-z; the same letter may appear any number of times, in either tree.

5
B B a b c
5
B a B b c

EQUIVALENT

3
B a a
3
B a b

NOT EQUIVALENT