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 Python (3.4.3) (judge verdict: Wrong Answer)

def getInput():
    return list(input().rstrip())

def firstCheck(S):
    N = len(S)-1
    c = int((N)/2)

    ret = True
    for i in range(c):
        # Sの回文判定
        if not S[i] == S[N-i]:
            ret = False;break;
    if ret:
        a = [str(S[i]) for i in range(c)]
        b = [str(S[i]) for i in range(c+1, N+1)]
        ret = True if secondCheck(a) and secondCheck(b)  else False
            
    return ret

def secondCheck(S):
    N = len(S)-1
    c = int((N)/2)
    ret = True

    for i in range(c):
        if not S[i] == S[N-i]:
            ret = False;break;
    return ret

S = getInput()
if len(S) < 5:
    print('No')
else:
    print('No') if not firstCheck(S) else print('Yes')