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
def RoKuKer(s):
    n = len(s)

    if n%2 != 1:
        return "No"

    s_reverse = ''
    for i in range(n-1, -1, -1):
        s_reverse += s[i]
    if s != s_reverse:
        return "No"

    l = s[:(n-1)/2]; l_recerse = ''
    r = s[(n+1)/2:]; r_reverse = ''

    for i in range(len(l)-1, -1, -1):
        l_recerse += l[i]
    for i in range(len(r)-1, -1, -1):
        r_reverse += r[i]
    
    if l != l_recerse or r != r_reverse:
        return "No"
    
    return "Yes"




if __name__ == '__main__':
    S = str(raw_input())
    print RoKuKer(S)