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
# coding: utf-8

s = raw_input()

def isp(x):
    leng = len(x)
    #print leng
    #print [(s[i], s[leng - i - 1]) for i in xrange(leng // 2)]
    return all(s[i] == s[leng - i - 1] for i in xrange(leng // 2))

n = len(s)
x1 = s[0:n // 2]
x2 = s[(n + 3) // 2 - 1:n]
#print s
#print x1,0,n//2
#print x2,(n+3)//2-1,n
print ['No', 'Yes'][isp(s) and isp(x1) and isp(x2)]
