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: Runtime Error)

let c = inp => { console.log(inp) };
let is_kaibun = s => {
    let ln = s.length;
    let ans = true;
    for (let i = 0, l = (ln - 1) / 2; i < l; i++) {
        // console.log(s[i])
        // console.log(s[ln - i - 1])
        if (s[i] != s[ln - i - 1]) {
            ans = false;
            break;
        }
    }
    return ans;
}
let s = require("fs").readFileSync("/dev/stdin", "utf8").slice(0, -1)
let ln = s.length;
let ans = is_kaibun(s)
    && is_kaibun(s.slice(0, (ln - 1) / 2))
    && is_kaibun(s.slice((ln + 1) / 2), ln);
console.log(ans ? "Yes" : "No");