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 l = S.length();
    if(!parin(S)){
      System.out.println("No");
      return;
    }
    String zenhan = S.substring(0,(l-1)/2);
    String kouhan = S.substring((l+1)/2,l);
    if(!parin(zenhan)||!parin(kouhan)){
      System.out.println("No");
      return;
    }
    System.out.println("Yes");
  }
  
  public static boolean parin(String S){
    for(int i=0;i<S.length()-1;i++){
      if(!S.substring(i,i+1).equals(S.substring(S.length()-i-1,S.length()-i))){
        return false;
      }
    }
    return true;
  }
    
      
  }
  

  