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;

const int M=105;
char s[M];

bool isp(int l,int r)
{
	while(l<r)
	{
		if(s[l]!=s[r]) return false;
		l++;
		r--;
	}
	return true;
}

int main()
{
	scanf("%s",s+1);
	int n=strlen(s+1);
	printf("%s\n",isp(1,n)&&isp(1,(n-1)/2)&&isp((n+3)/2,n)?"Yes":"No");
	return 0;
}