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 JavaScript (node.js v5.12) (judge verdict: Wrong Answer)

// 2020/03/22 21:18 - 21:30
// 
function Main(input) {
	var len = input.length;
	var tgt = parseInt(len / 2);
	var establishment = true;

	for(var i = 0; i < tgt && establishment; i++) {
		var left = input[i];
		var right = input[len - i - 1];
		if(left != right) {
			establishment = false;
		}
	}

	tgt = parseInt((len - 1) / 2) - 1;
	for(var i = 0; i < tgt && establishment; i++) {
		var left = input[i];
		var right = input[tgt - i];
		if(left != right) {
			establishment = false;
		}
	}

	var init = parseInt((len + 3) / 2) - 1;
	tgt = len - init;
	for(var i = 0; i < tgt && establishment; i++) {
		var left = input[init + i];
		var right = input[len - i - 1];
		if(left != right) {
			establishment = false;
		}
	}

	var out = (establishment) ? "Yes" : "No";
	console.log(out);
}
Main(require("fs").readFileSync("/dev/stdin", "utf8"));