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) {
		Main main = new Main();
		main.run();
	}

	public void run() {
		Scanner sc = new Scanner(System.in);
		String s = sc.next();
		int len = s.length();
		String s1=s.substring(0, (len-1)/2);
		String s2=s.substring(((len+3)/2)-1,len);
		boolean ans1=check(s1);
		boolean ans2=check(s2);
		if(ans1&&ans2&&s1.equals(s2)) {
			System.out.println("Yes");
		}else {
			System.out.println("No");
		}
		sc.close();
	}

	public boolean check(String s) {
		int n = s.length();
		for(int i=0; i<(n)/2; i++) {
			if( s.charAt(i) != (s.charAt(n-1-i))) {
				return false;
			}
		}
		return true;
	}
}
