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;

string a;

bool pal(string a)
{
	string r=a;
	reverse(r.begin(),r.end());
	return r==a;
}

int main()
{
	cin>>a;


	int n=a.size();
	if(a.size()%2==0 or !pal(a)) cout<<"No";
	else
	{
		if(pal(a.substr(0,(n-1)/2)) && pal(a.substr((n+1)/2))) cout<<"Yes";
		else cout<<"No";
	}
}