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
#include<bits/stdc++.h>

int main(){
    using namespace std;
    string S;
    cin >> S;
    unsigned long N{S.size()}, M{N / 2};
    for(unsigned long i{1}; i < M; ++i)if(S[i - 1] != S[M - i] || S[M - i] != S[M + i] || S[M + i] != S[N - i])return 0 & puts("No");
    puts("Yes");
    return 0;
}