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 Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.io.*;

public class Main{
  static boolean kaibun(String s){
  boolean result = false;
  int l = s.length();
  int i=0;
  for(i=0; i<(l-1)/2; i++){
      if(s.charAt(i)!=s.charAt(l-i-1)) break;
  }
  if(i==(l-1)/2) result=true;
  return result;
  }
  public static void main(String[] args){
    String str =null;
    try{
  	BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
    str = reader.readLine();
    }catch(IOException e){
        System.out.println("eo");
    
    }
    int l = str.length();
    String str1=str.substring(0,(l-1)/2);
    String str2=str.substring((l+1)/2,l);

    String strs[] = {str, str1, str2};
    int x;
    for (x=0;x<3;x++){
        if(!kaibun(strs[x])) {
            System.out.println("No");
            break;
        }
        x++;
    }
    if(x==4)System.out.println(x);
  }
}