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: Accepted)

def nyu():
    S= list(map(str,(input())))
    return S


def check(S ):
    Strong_str1 = ""
    Strong_str2 = ""
    Strong_str3 = ""

    for s in range(int(len(S)/2)):
        Strong_str1 += S[s]

    for s in range(int((len(S)+3)/2-1),len(S)):
        Strong_str2 += S[s]

    Strong_str3 = S[::-1]

    # print(Strong_str1)
    # print(Strong_str2)
    # print(Strong_str3)

    if Strong_str1 == Strong_str1[::-1] and Strong_str2 == Strong_str2[::-1] and S == S[::-1]:
        print("Yes")
    else:
        print("No")


            
S = nyu()
check(S)
#print(S)