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

public class Main {
  public static void main(String[] args) {
    Scanner scan = new Scanner(System.in);
    String S = scan.next();
    scan.close();

    String fS = S.substring(0, (S.length()-1)/2);
    String bS = S.substring((S.length()+1)/2, S.length());

    if(kai(S) && kai(fS) && kai(bS)) {
      System.out.println("Yes");
    }
    else {
      System.out.println("No");
    }
  }

  public static boolean kai(String s) {
    StringBuffer sb = new StringBuffer(s);
    String rs = sb.reverse().toString();
    if(s.equals(rs)) {
      return true;
    }
    else {
      return false;
    }
  }
}