Problem:
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 1

akasaka

Sample Output 1

Yes

S is akasaka.

The string formed by the 1-st through the 3-rd characters is aka.

The string formed by the 5-th through the 7-th characters is aka.
All of these are palindromes, so S is a strong palindrome.

Sample Input 2

level

Sample Output 2

No

Sample Input 3

atcoder

Sample Output 3

No

Solution in C (Clang 3.8.0) (judge verdict: Wrong Answer)

#include<stdio.h>
#include<string.h>
int main()
{
  int i,flg1=0,flg2=0,flg3=0;
  char p[10000];
  gets(p);
  for(i=0;i<strlen(p);i++)
  {
  	if(p[i]!=p[strlen(p)-1-i])
      break;
  }
  if(i==strlen(p))
    flg1=1;
  for(i=0;i<(strlen(p)-1)/2;i++)
  {
  	if(p[i]!=p[(strlen(p)-1)/2-i])
      break;
  }
  if(i==(strlen(p)-1)/2)
    flg2=1;
  for(i=0;i<(strlen(p)-1)/2;i++)
  {
  	if(p[(strlen(p)+1)/2+i]!=p[strlen(p)-1-i])
      break;
  }
  if(i==(strlen(p)-1)/2)
    flg3=1;
  if(flg1==1&&flg2==1&&flg3==1)
       	printf("Yes");
   else
       	printf("No");
    return 0;
}