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.lang.*;

public class Main {
    public static void main(String[] args) {
        //コード
        Scanner scanner = new Scanner(System.in);
        String x = scanner.next();
        String[] xx = x.split("");


        String check_char_one = new String();
        String check_char_two = new String();

        for (int i = 0; i < xx.length / 2; i++) {
            check_char_one += xx[i];
        }

        for (int i = ((xx.length + 3 ) / 2 -1); i < xx.length; i++) {
            check_char_two += xx[i];
        }

        if (check_char_one.equals(check_char_two)) {
            System.out.println("Yes");
        } else {
            System.out.println("No");
        }

    }
}