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 sc = new Scanner(System.in);
    String s = sc.next();
    sc.close();
    System.out.println(isStrongPalindrome(s) ? "Yes" : "No");
  }
  static boolean isStrongPalindrome(String s){
    int left1 = 0;
    int right1 = s.length() - 1;
    int left2 = 0;
    int right2 = ((s.length() - 1 ) / 2) - 1;
    while(left1 <= right1){
      if(s.charAt(left1) != s.charAt(right1)){
        return false;
      }
      left1++;
      right1--;
    }
    while(left2 <= right1){
      if(s.charAt(left2) != s.charAt(right2)){
        return false;
      }
      left2++;
      right2--;
    }
    return true;
  }
}
