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 Java (OpenJDK 11.0.6) (judge verdict: Runtime Error)

import java.util.Scanner;
import java .util.ArrayList;
public class Main {
public static void main(String[] args) {
	Scanner sc = new Scanner(System.in);
	
	String inputS = sc.next();
	
	ArrayList<String>  slist = new ArrayList<>();
	ArrayList<String>  first = new ArrayList<>();
	ArrayList<String>  second = new ArrayList<>();
	
	for(int i = 0; i < inputS.length(); i++) {
		slist.add(inputS.substring(i, i+1));
	}
	
	for(int i = 0; i < (inputS.length() - 1) /2; i++) {
			first.add(slist.get(i));
	}
	
	for(int i = (inputS.length() + 3) / 2; i <= inputS.length(); i ++) {
		second.add(slist.get(i));
	}
	
	String str1 = String.join("", first);
	String str2 = String.join("", second);
	
	if(isPalindrome(str1) && isPalindrome(str2)) {
		System.out.println("Yes");
	}else {
		System.out.println("No");
	}
	
}

public static boolean isPalindrome(String sentence) {
    int minIdx = 0;
    int maxIdx = sentence.length() - 1;

    while(minIdx < maxIdx) {
        if(sentence.charAt(minIdx++) != sentence.charAt(maxIdx--)) {
            return false;
        }
    }
    return true;
}
}