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
import java.util.*;

public class Main {
public static void main(String[] args) {
		
		Scanner keyboard = new Scanner(System.in); 
		
		String S = keyboard.next();
		int L = (S.length()-1)/2;
		char[]s1 = new char[L];
		char[]s2 = new char[L];
		
		
		for(int i=0; i<S.length(); i++) {
			if(i < L) {
				s1[i] = S.charAt(i);
			}else if(i > L) {
				s2[i-L-1] = S.charAt(i);
			}
		}
		
		String ans = "No";
		
		for(int j=0; j<=L/2; j++) {
			if(s1[j]==s2[j]&& s1[L-1-j]==s2[L-1-j] && s1[j] == s1[L-1-j] && s2[j] == s2[L-1-j]) {
				ans = "Yes";
			}else {
				ans = "No";
				break;
			}
		}
		
		System.out.println(ans);
		keyboard.close();	
	}
}

