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.Scanner;
public class Main {

	public static void main(String[] args) {
		Scanner stdIn = new Scanner(System.in);

		String s = stdIn.next();
		
		boolean flag = true;
		
		
		for(int i = 0; i < s.length()/2; i++) {
			if(s.charAt(i)!=s.charAt(s.length()-1-i)) {
				flag = false;
			}
		}
		

		int cnt = 1;
		for(int i = 0; i < (s.length()-1)/2; i++) {
			if(s.charAt(i)!=s.charAt((s.length()-1)/2-cnt)){
				flag = false;
			}
			cnt++;
		}
		

		cnt = 0;
		for(int i = (s.length()+3)/2-1; i < s.length(); i++) {
			if(s.charAt(i)!=s.charAt(s.length()-1-cnt)){
				flag = false;
			}
			cnt++;
		}

		if(flag) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
	}

}
