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)

/*
 * To change this license header, choose License Headers in Project Properties.
 * To change this template file, choose Tools | Templates
 * and open the template in the editor.
 */

import java.util.Scanner;

/**
 *
 * @author wnqmw
 */
public class Main {
    public static void main(String args[]) {
        Scanner kb = new Scanner(System.in);
        
        String k = kb.nextLine();
        boolean fin = false;
        int i = 0;
        int j = k.length()-1;
        
        while(i <= j){
            if(k.charAt(i) != k.charAt(j)){
                System.out.println("No");
                fin = true;
                break;
            }
            i++;
            j--;
        }
        i = 0;
        j = (k.length()-1)/2-1;
        while(i <= j && fin != true){
            System.out.println(k.charAt(i) + " lol " + k.charAt(j));
            if(k.charAt(i) != k.charAt(j)){
                System.out.println("No");
                fin = true;
                break;
            }
            i++;
            j--;
        }
        i = (k.length()+3)/2-1;
        j = k.length()-1;
        while(i <= j && fin != true){
            System.out.println(k.charAt(i) + " lmao " + k.charAt(j));
            if(k.charAt(i) != k.charAt(j)){
                System.out.println("No");
                fin = true;
                break;
            }
            i++;
            j--;
        }
        if(fin == false){
            System.out.println("Yes");
        }
    }
}