RoAlgo Contest #9 | Square or Prime Digit?

Task

You are given an integer $x$ with $n$ digits. While trying to think at various problems for the Runtime Terror Competition, the scientific committee stumbled upon some basic math definitions:

A number $x$ is a perfect square if there is an integer $y$ such that $y^2 = x$. A number $y$ is a prime number if its only divisors are $1$ and $y$.

Similarly, a square digit is a digit which is perfect square and a prime digit is a digit which is a prime number.

Now your goal is to find out whether the given number has more square digits or more prime digits. If there is an equality, print Equal.

Input data

On the first line you are given $n$, the length of the integer. On the next line you are given the integer, represented as a string of length $n$. The integer is represented with digits from $0$ to $9$ and has no leading zeroes.

Output data

You will print Square if it has more square digits than prime digits, Prime if it has more prime digits than square digits or Equal, if we have equality.

Constraints and clarifications

• $1 \leq n \leq 100$;

Example

stdin

6
402497

stdout

Square

Explanation

The given number, $402497$ has $4$ square digits ($4$, $0$, $4$ and $9$) and $2$ prime digits ($2$ and $7$).