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
// B - String Palindrome
#include <bits/stdc++.h>
using namespace std;

string S;

bool ok(int l, int r){//[l,r)
	string s = S.substr(l,r);
	string t(s.rbegin(), s.rend());
	return s==t;
}

int main(){
	cin>>S;
	int n = S.size();
	if(ok(0,n) && ok(0, (n-1)/2) && ok((n+1)/2,n)) puts("Yes");
	else puts("No");
}