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 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<stdio.h>
#include<string.h>
int main()
{
  int n, i, temp, x, y;
  char a[100], b[100], c[100], d[100],e[100],f[100];
  
  gets(a);
  n = strlen(a);
  
  for(i=0; i<n; i++)
  b[i] = a[i];
  for(i=0; i<n/2; i++)
  {
      temp = b[i];
      b[i] = b[n-1-i];
      b[n-1-i] = temp;
  }
  
  x = (n-1)/2;
  y = (n+3)/2;
  
  for(i=0; i<x; i++)
  {
      c[i] = a[i];
      d[i] = a[i];
  }
  
  
  for(i=0; i<x/2; i++)
  {
      temp = d[i];
      d[i] = d[x-1-i];
      d[x-1-i] = temp;
  }
  
  
  for(i=y-1; i<n; i++)
  {
      e[i] = a[i];
      f[i] = a[i];
  }
  
  
  for(i=y-1; i<y; i++)
  {
      temp = f[i];
      f[i] = d[n-1-i];
      f[n-1-i] = temp;
  }
  
  
  
  if(strcmp(a,b)==0&&strcmp(c,d)==0&&strcmp(e,f)==0)
  printf("yes");
  else
  printf("no");
  
  return 0;
}