Family Tree

Input

The first line contains an integer n~(1 \le n \le 100) followed by the names of two cows. Each cow name is a string of at most $10$ uppercase letters ($A$ to $Z$). Farmer John wants to know how these two cows are related.

Each of the next $n$ lines contains two cow names $X$ and $Y$, meaning that $X$ is the mother of $Y$.

Output

Print one line describing the relationship between the two cows given in the first line of the input. For simplicity, in the descriptions below, we call these two cows BESSIE and ELSIE. The possible relationships are as follows:

• If BESSIE and ELSIE have the same mother, print "SIBLINGS".

• BESSIE may be a direct descendant of ELSIE, that is, ELSIE may be the mother, grand-mother, great-grand-mother, great-great-grand-mother, and so on, of BESSIE. In this case, print "ELSIE is the (relation) of BESSIE", where (relation) is the appropriate relationship, for example, "great-great-grand-mother".

• If ELSIE is a child of an ancestor of BESSIE (and ELSIE is neither an ancestor nor a sister of BESSIE), then ELSIE is an aunt of BESSIE. Print "ELSIE is the aunt of BESSIE" if ELSIE is a child of BESSIE's grand-mother, "ELSIE is the great-aunt of BESSIE" if ELSIE is a child of BESSIE's great-grand-mother, "ELSIE is the great-great-aunt of BESSIE" if ELSIE is a child of BESSIE's great-great-grand-mother, and so on.

• If BESSIE and ELSIE are related in any other way (that is, they have a common ancestor), they are cousins, and you should simply print "COUSINS".

• If neither cow is a descendant of the other and they have no common ancestor, print "NOT RELATED".

The diagram below illustrates these relationships, which are the only ones you need to consider. Note that some relationships, such as "niece" (the daughter of a sister), are not needed: if BESSIE is a niece of ELSIE, then ELSIE is an aunt of BESSIE.

Examples