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  moji = sc.nextLine();
        String moji2 = moji.substring(0,(moji.length()-1)/2);
        String moji3 = moji.substring((moji.length()+1)/2,moji.length());

        //System.out.println(moji2);
        //System.out.println(moji3);

        String flag = "No";

        if(moji2.equals(moji3)) flag = "Yes";
        System.out.println(flag);

    }
}