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();
		String ans="Yes";
		//回分判定1
		for(int i=1;i<=(S.length());i++){
			if(S.charAt(i-1)==S.charAt(S.length()-i)){
			}
			else{
			ans="No";
			}
		}
		//回分判定2
		for(int i=1;i<=(S.length()-1)/2;i++){
			if(S.charAt(i-1)==S.charAt(((S.length()-1)/2)-i)){
			}
			else{
			ans="No";
			}
		}
		//回分判定3
		for(int i=(S.length()+3)/2;i<=(S.length());i++){
			if(S.charAt(i-1)==S.charAt(((S.length()+3)/2)+(S.length())-i-1)){
			}
			else{
			ans="No";
			}
		}
		System.out.println(ans);
        }
    }