A string of length n is called super-string if among all possible substrings of the given string, exactly n-1 substrings are non-palindrome and else all are palindrome. Given a string as input, tell whether the given string is a super-string or not.
A string containing only lowercase english alphabets.
1 <= |length of string| <= 100000
Output YES if the given string is a super-string and NO otherwise.