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>
using namespace std;
int main()
{
   string s,a,b;
   cin>>s;
   int n=s.size();

   for(int i=0;i<(n-1)/2;i++)
   {
       a.push_back(s[i]);
   }

   for(int i=(n+3)/2-1;i<n;i++)
   {
       b.push_back(s[i]);
   }

   if(a==b)
    cout<<"Yes\n";
   else
    cout<<"No\n";

   exit(0);
}
