L. Le Café
time limit per test
0.5 seconds
memory limit per test
1024 megabytes
input
standard input
output
standard output

You are the attendant of the best coffee shop in the world: Le Café (a French franchise). One day, near closing time, three students, Malu, Débora, and Lívia, enter the shop and get ready to place their orders. Malu, as she doesn't like coffee, orders only a brownie (world-renowned for being cheap and delicious). Débora and Lívia, on the other hand, order the Vanille Glacée, a mixture of coffee, vanilla essence, milk, and most importantly: SPRINKLES.

After ordering their drinks on the table's tablet, Débora and Lívia approach your counter and make an unusual demand: "We will only accept our Vanille Glacée if both have the exact same number of sprinkles, and that number is greater than zero. If not, cancel our order." After that, the two turn around and hurry back to their table. You, confused, open the sprinkle cabinet and see $$$N$$$ packages, fearing that you won't be able to fulfill the order. Like anyone in such a situation would do, you chat nicely with the two friends to try to reach a consensus you open your notebook and start programming a solution.

Note that each package can be used exactly once, and due to Le Café's policies, a package must be used entirely, and all the sprinkles must go into the same Vanille Glacée. The justification is that this prevents packages from being open for too long, thus affecting the texture of the sprinkles. Therefore, given the quantity of sprinkles contained in each of the packages, inform whether you will be able to serve Débora and Lívia's Vanille Glacée.

Input

The first line of input contains the integer $$$N$$$ $$$(1 \le N \le 2 \cdot 10^5)$$$, the number of sprinkle packages. The following line contains $$$N$$$ integers $$$A_i$$$ $$$(1 \le A_i \le 2 \cdot 10^5)$$$, each representing the quantity of sprinkles in package $$$i$$$.

Output

Print 'S' on a single line if it is possible to serve the Vanille Glacée, or 'N' otherwise.

Examples
Input
4
1 2 3 4
Output
S
Input
1
100
Output
N
Note

In the first example, the answer is 'S' as we can use the packages with $$$1$$$ and $$$4$$$ sprinkles in Débora's Vanille Glacée and the packages with $$$2$$$ and $$$3$$$ sprinkles in Lívia's coffee, resulting in both having 5 sprinkles. Another way would be to use the packages with $$$1$$$ and $$$2$$$ sprinkles in Débora's coffee and the package with $$$3$$$ sprinkles in Lívia's, resulting in both having 3 sprinkles.

In the second example, the answer is 'N' as there is only a single package of sprinkles available, and we cannot have the Vanille Glacée without any sprinkles. Therefore, if we decide to use the only package in Débora's coffee, it would have $$$100$$$ sprinkles while Lívia's would have none, and vice versa.