Distinct Flower Colors

You are given an integer n representing the number of years a plant has been observed, and a string s representing the sequence of flower colors during these years. Each character in the sequence denotes a color. Your task is to determine whether all the colors in the sequence are distinct.

If every color appears only once, print SPECIAL; otherwise, print NOT SPECIAL.

In mathematical terms, given a string s of length n, you should print SPECIAL if and only if:

Otherwise, print NOT SPECIAL.

inputFormat

The input is read from stdin and consists of two lines:

• The first line contains an integer n (1 ≤ n ≤ 10⁴), representing the length of the sequence.
• The second line contains a string s consisting of n characters which represent the flower colors. The string may include both uppercase and lowercase letters.

outputFormat

The output is printed to stdout. Print a single line containing SPECIAL if all characters in the string are distinct, or NOT SPECIAL if there is any repetition.

4
abcd

SPECIAL