<? echo $row['title']." - ".$MSG_PROBLEM." - ".$OJ_NAME; ?>

Problem2220--abc159b-strong palindrome

2220: abc159b-strong palindrome

_{[Creator : ]}

Time Limit : 1.000 sec Memory Limit : 128 MB

Submit Solved: 13 Submit Num: 26 Statistics

Description

Time Limit: 2 sec / Memory Limit: 1024 MB

Score :

200

points

Problem Statement

A string

S

of an odd length is said to be a strong palindrome if and only if all of the following conditions are satisfied:

$S$ is a palindrome.
Let $N$ be the length of $S$ . The string formed by the $1$ -st through $((N - 1) / 2)$ -th characters of $S$ is a palindrome.
The string consisting of the $(N + 3) / 2$ -st through $N$ -th characters of $S$ is a palindrome.

Determine whether

S

is a strong palindrome.

Constraints

$S$ consists of lowercase English letters.
The length of $S$ is an odd number between $3$ and $99$ (inclusive).

Input

Input is given from Standard Input in the following format:

$S$

Output

If

S

is a strong palindrome, print Yes; otherwise, print No.

Sample Input Copy

akasaka

Sample Output Copy

Yes

Source/Category

AtCoder

Submit