Manuel thinks that Diego is his long lost brother. But Diego thinks Manuel is wrong, and to prove it, he got DNA samples from himself and Manuel. Now Diego has given you the DNA samples and it is your task to say whether they are brothers or not.

The DNA samples of Diego and Manuel are strings $A$ and $B$, both have length $n$ ($1 \leq n \leq 10^5$) and consist of only the characters 'A', 'T', 'G' and 'C'. If there is a common subsequence of $A$ and $B$ that has length greater than or equal to $0.99 \times n$, then Diego and Manuel are brothers, in other case, they are not.

A subsequence of a string $X$ is any string that you can get by removing any number of characters from $X$.

A common subsequence of strings $X$ and $Y$ is a string that is a subsequence of both $X$ and $Y$.

The kid Andrew doesn't like coins. His country currently uses n different coin types, each with a different value. It is guaranteed that the coin with value 1 is one of the different coin types.

Andrew's weekly taco-pizza grocery list contains r - l + 1 items with costs l, l + 1, ..., r. Unfortunately, Andrew needs to buy each of these items separately as they are sold at different stores. Furthermore, these stores do not give any change, so Andrew must pay the exact amount in coins. Andrew is rather unhappy with the amount of coins he needs to handle every week, so he wants to convince his country to start using a new coin type to minimize the total number of coins needed to buy groceries for his weekly taco-pizza needs.

Andrew is too busy infiltrating UBC, so he wants you to tell him the best coin type to add, or that no new coin types can decrease the amount of coins he needs to use.