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 PyPy3 (7.3.0) (judge verdict: Wrong Answer)

S = list(input())
MID = (len(S) // 2) + 1


LAST = len(S) + 1



F = S[0:MID - 1]
L = S[MID : LAST]
LL = L[::-1]


if F != LL or (((len(S)-1)/2)%2) == 0:
    print('No')

    
    MID_F = (len(F) // 2) + 1
    MID_L = (len(L) // 2) + 1

    FFF = F[0:MID_F-1]
    FFFF = F[MID_F : LAST]
    FFFFF = FFFF[::-1]
    if FFF != FFFFF:
        print('No')


        LLL = L[0:MID_F-1]
        LLLL = L[MID_F : LAST]
        LLLLL = LLLL[::-1]
        if LLL != LLLLL:
            print('No')

            
else:
    print('Yes')