Problem2206--ABC237C - kasaka

2206: ABC237C - kasaka

[Creator : ]
Time Limit : 1.000 sec  Memory Limit : 128 MB

Description

Problem Statement

Given is a string SS consisting of lowercase English letters. Determine whether adding some number of a's (possibly zero) at the beginning of SS can make it a palindrome.
Here, a string of length NNA=A_1A_2\ldots A_NA=A1A2AN, is said to be a palindrome when A_i=A_{N+1-i}Ai=AN+1i for every 1\leq i\leq N1iN.

Constraints

  • 1 \leq \lvert S \rvert \leq 10^61S106
  • SS consists of lowercase English letters.

Input

Input is given from Standard Input in the following format:
SS

Output

If adding some number of a's (possibly zero) at the beginning of SS can make it a palindrome, print Yes; otherwise, print No.

Sample Input Copy

kasaka

Sample Output Copy

Yes

Source/Category