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 sc = new Scanner(System.in);
		String s = sc.next();
		int n = s.length();
		StringBuffer sb = new StringBuffer(s);
		if(!sb.toString().equals(sb.reverse().toString())){
			System.out.println("No");
			return;
		}
		StringBuffer sb1 = new StringBuffer(s.substring(0,(n-1)/2));
		if(!sb1.toString().equals(sb1.reverse().toString())){
			System.out.println("No");
			return;
		}
		StringBuffer sb2 = new StringBuffer(s.substring((n+1)/2,n));
		if(!sb2.toString().equals(sb1.reverse().toString())){
			System.out.println("No");
			return;
		}
		System.out.println("Yes");
	}
}