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.*;

class Main{
	public static void main(String[] args){
      Scanner scn = new Scanner(System.in);
      String word = scn.nextLine();
      int n = word.length();
      int m = (n-1)/2;
      for(int i = 0; i < m+1;i++){
        if(word.charAt(i)!=word.charAt(n-1-i)){
          System.out.println("No");
          return;
        }
      }
      for(int j = 0; j<(m+1)/2;j++){
        if(word.charAt(j)!=word.charAt(m-1-j)){
          System.out.println("No");
          return;
        }
      }
      System.out.println("Yes");
	}
}
