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();
StringBuffer s1=new StringBuffer(s);
s1.reverse();
if(s.equals(s1.toString()))
{
int n=s.length();
int r=(n-1)/2;
String a=s.substring(0,r);
StringBuffer s2=new StringBuffer(a);
s2.reverse();
if(a.equals(s2.toString()))
{
int r1=(n+3)/2;
String b=s.substring(r1-1,n);
StringBuffer s3=new StringBuffer(b);
s3.reverse();
if(b.equals(s3.toString()))
System.out.println("Yes");
else
System.out.println("No");
}
else
System.out.println("No");
}
else
System.out.println("No");



}

}