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) throws Exception {
        
        Scanner scn = new Scanner(System.in);
        String S = scn.nextLine();
        int N = S.length();
        
        String str_before = S.substring(0,(N-1)/2);
        String str_after = S.substring((N+2)/2,N);
        StringBuffer hoge = new StringBuffer(str_before);
        String str = hoge.reverse().toString();
        if(str_after.equals(str) && str_after.equals(str_before)) System.out.println("Yes");
        else System.out.println("No");
        
    }
}
