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 scan = new Scanner(System.in);
    String a = scan.next();
    int b = a.length();
    int c = (int) (b-1)/2;
    int d = (int) (b+3)/2;

    boolean a1 = check(a,0,b-1);
    boolean a2 = check(a,0,c-1);
    boolean a3 = check(a,d-1,b-1);

    if ((a1 == false) || (a2 == false) || (a3 == false)){
      System.out.println("No");
    }
    else{
      System.out.println("Yes");
    }


  }

  public static boolean check(String a, int b, int c){
    for (int i=b;i<c;i++){
      if (a.charAt(i) != a.charAt(c-i)){
        return false;
      }
    }
    return true;
  }
}
