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(void){
char s[100];
  scanf("%s",&s);
  char mae[50],ato[50];
  for(int i=0;i<50;i++){
	mae[i]=0;
    ato[i]=0;
  }
  for(int i=0;i<strlen(s)/2;i++){
	mae[i]=s[i];
    ato[i]=s[i+strlen(s)/2+1];
    //printf("%c %c\n",mae[i],ato[i]);
  }
  //printf("%d\n%d\n%d\n",strlen(s),strlen(mae),strlen(ato));
  for(int i=0;i<strlen(s)/2;i++){
    if(s[i]!=s[strlen(s)-1-i]){
      printf("No");
      return 0;
    }
    }
     for(int i=0;i<strlen(mae)/2;i++){
    if(mae[i]!=mae[strlen(mae)-1-i]){
      printf("No");
      return 0;
    }} 
       for(int i=0;i<strlen(ato)/2;i++){
    if(ato[i]!=ato[strlen(ato)-1-i]){
      printf("No");
      return 0;
    }}
         printf("Yes");
      printf("%d\n%d\n",strlen(mae),strlen(ato));
      return 0;
      }