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;
string s;
bool pd(int a,int b)
{
	for(int i=a;i<=(a+b)/2;++i)
		if(s[i]!=s[b-i+a])
			return false;
	return true;
}
int main()
{
	cin>>s;int l=s.length();
	if(pd(0,l-1)&&pd(0,(l-1)/2-1)&&pd((l+3)/2-1,l-1))	cout<<"Yes";
	else											cout<<"No";
}