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`.

Examples

Input

akasaka


Output

Yes


Input

level


Output

No


Input

atcoder


Output

No
S = raw_input()

N = len(S)

is_flag = True
for i in range(N):
    if S[i] != S[N-1-i]:
        is_flag = False

M = (N-1)/2
for i in range(M/2):
    if S[i] != S[M-1-i]:
        is_flag = False


for i in range(M/2):
    if S[i+(N+1)/2] != S[N-1-i]:
        is_flag = False


if is_flag:
    print "Yes"
else:
    print "No"


