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