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
input = raw_input

s = input()
n = len(s)

ok = True
for i in range(n):
    if s[i] != s[n-1-i]:
        ok = False
        break

if ok:
    n1 = (n-1) // 2
    for i in range(n1):
        if s[i] != s[n1-1-i]:
            ok = False
            break
if ok:
    n2 = (n+3) // 2
    i2 = n-1
    for i1 in range(n2-1, n):
        if s[i1] != s[i2]:
            ok = False
            break
        i2 -= 1
if ok:
    out = "Yes"
else:
    out = "No"
print(out)