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>
using namespace std;
int main() {
	string s1="",s2="",s;
	cin>>s;
	bool flag = false;

	for(int i=0;i<s.size()/2;i++){
		
		s1 += s[i];
	}
	for(int i=(s.size()+3)/2-1;i<s.size();i++){
		s2 += s[i];
	}
	//cout<<s1<<" "<<s2<<endl;
	if(s1 != s2)
		cout<<"No"<<endl;
	else
		cout<<"Yes"<<endl;
	return 0;
}