F. Fraud Detection
time limit per test
2.25 seconds
memory limit per test
1024 megabytes
input
standard input
output
standard output

At the Institute of Messy Etiquette, known more commonly as IME, people have been suspecting that some fraud has been occurring since the commander has for some time been announcing several budget cuts to his own faculty while at the same time funding his own expensive vanity projects. You quickly mention this one time to some people well connected with the higher ups, and on one fine Wednesday afternoon, the two most respected colonels of the entire institute go have a quick word with you.

Dwart and Delphine figure out that if they cahoot against the commander and figure out something fishy, then a power shift can happen. Turns out that they have been binging the YouTube channel Numberphile quite a lot recently and stumbled upon a video about Benford's Law. The law is an observation that in many real-life data sets of numerical data, the leading digit is likely to be small. Upon further research, they see that Wikipedia states that: Based on the plausible assumption that people who fabricate figures tend to distribute their digits fairly uniformly, a simple comparison of first-digit frequency distribution from the data with the expected distribution according to Benford's law ought to show up any anomalous results.

Now possessed with this knowledge, both colonels have been able to somehow get their hands on a dataset containing $$$n$$$ numbers pertaining to costs associated with running the institute. They feel as if they've done too much, and now they rely on your help in order to figure out whether the suspicions are true. Given the dataset, figure out whether it's plausible that some fraud is occurring. Since they just want to know if it can be ruled out or not, you need to figure out, within this data set, whether the number $$$1$$$ appears as the leading significant digit more than any other digit.

Input

The first line of the input contains a single integer, $$$n$$$ $$$(1 \leq n \leq 2 \times 10^6)$$$ — the amount of elements in the dataset.

The second line contains $$$n$$$ integers $$$a_i$$$ $$$(-10^{18} \leq a_i \leq 10^{18})$$$ — numbers present in the dataset.

Output

If you think that it's plausible that the dataset was manipulated, output suspicious in a single line; otherwise, output unfortunately not.

Examples
Input
5
99999999999 999999999999999 -99999999999 9999999999 420
Output
suspicious
Input
10
38123 2118328 11273 -44884 18381238 99484832 -664361 87372 777372 -588382
Output
unfortunately not