A palindrome is a word that is the same when read forwards
and backwards.
Write a program that, given a string $s$, determines if $s$ is a palindrome.
Input
Input consists of one line, the string $s$, where $1 \leq |s| \leq 10^5$. Each character
of the string is a lowercase letter in the English
alphabet.
Output
Output consists of one line containing Palindrome! if $s$ is a palindrome, and Nothing special about this string :( if
not.
| Sample Input 1 |
Sample Output 1 |
racecar
|
Palindrome!
|
| Sample Input 2 |
Sample Output 2 |
abba
|
Palindrome!
|
| Sample Input 3 |
Sample Output 3 |
nope
|
Nothing special about this string :(
|
| Sample Input 4 |
Sample Output 4 |
neibb
|
Nothing special about this string :(
|
| Sample Input 5 |
Sample Output 5 |
raksapupaskar
|
Palindrome!
|
