Palindrome
Problem
Given a word (all letters are lowercase).
Output the word
YES if the input word is a palindrome (a word that reads the same from left to right as from right to left). Otherwise, print
NO and on the new line, the index of the first character from the beginning of the original string, which does not allow building a palindrome.
Examples
| # |
Input |
Output |
| 1 |
level |
YES |
| 2 |
sags |
NO
1 |
Запрещенные операторы: reverse; :-1