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<iostream>
#include<string>

using namespace std;

int main(void)
{
  string s; cin>>s;
  int n=s.size();
  int moji1=(n-1)/2;
  int moji2=(n+3)/2;
  string s1=s.substr(0,moji1);
  string s2=s.substr(moji2-1);
  
  if(s1==s2){puts("Yes");}
  else{puts("No");}
  
  //cout<<s1<<endl<<s2<<endl;
  return 0;
}