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,t,ans;
        boolean eq,eq2;        
        Integer n;

        ans="";
        s=sc.next();
        n=s.length();
        StringBuffer str = new StringBuffer(s);
        t=str.reverse().toString();

        eq=s.equals(t);
        t=s.substring((n+1)/2, n);
        s=s.substring(0,(n-1)/2);
        eq2=s.equals(t);
        
        if(eq && eq2){
            ans="Yes";
        }else{
            ans="No";
        }

        System.out.println(ans);

    }
}