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.*;
import java.io.*;

public class Main{
    public static void main(String[] args){
	Scanner sc = new Scanner(System.in);
	String s = sc.next();
    StringBuffer sb = new StringBuffer(s);
    String rs = sb.reverse().toString();
    boolean b = true;
    int n = s.length();
    if(!rs.equals(s))
      b = false;
      String s1 = s.substring(0 , (n - 1) / 2);
      String s2 = rs.substring((n + 1) / 2 , n);
    if(!s1.equals(s2))
      b = false;
      String s3 = rs.substring(0 , (n - 1) / 2 );
      String s4 = s.substring((n + 1) / 2 , n);
    if(!s3.equals(s4))
      b = false;
	System.out.println(b ? "Yes" : "No");
	}
}