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 n;
string s,s1,s2;
int main(){
  cin>>s;
  n=s.size();
  s1=s.substr(0,(n-1)/2);
  s2=s.substr((n+1)/2,(n-1)/2);
  if(s1!=s2)	 {cout<<"No";return 0;} 
	  
  for(int i=0;i<(n-1)/2;i++)
{
	if(s[i]!=s[(n-3)/2-i])
	 {cout<<"No";return 0;
	  } 
}
cout<<"Yes";
return 0;
}
