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<stdio.h>
#include<string.h>
bool f(char* s,int i,int j){
	int t=j/2;
	for(int k=i;k<=t;k++){
		if(s[k]!=s[j-k+1])return 0;
	}
	return 1;
}
int main(){
	char s[10000]={'a'};
	scanf("%s",s+1);
	int N=strlen(s)-1;
	if(f(s,1,(N-1)/2)&&f(s,(N+3)/2,N)&&f(s,1,N))printf("Yes\n");
	else printf("No\n");
}