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) {
		// TODO Auto-generated method stub
		Scanner sc = new Scanner(System.in); 
		String s = sc.nextLine(); 
		if (s.length()%2==0) {
			System.out.println("Yes");
			return; 
		}
		int N = s.length(); 
		String s1 = s.substring(0, (N-1)/2);
		String s2 = s.substring((N+3)/2-1, N); 
		String res = s2 + s.charAt((N+1)/2-1) + s1; 
		if (res.equals(s)) System.out.println("Yes");
		else System.out.println("No");
		sc.close();
	}

}