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

class Main {

    static public boolean solve(String s) {
        int mid = s.length()/2;
        String lh = s.substring(0, mid);
        String rh = s.substring(mid+1);
        if (! lh.equals(rh)) return false;
        int i = 0, j = lh.length()-1;
        while (i < j) {
            if (lh.charAt(i) != lh.charAt(j)) {
                return false;
            }
            i++; j--;
        }
        return true;
    }

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);

        String s = sc.next();

        sc.close();

        System.out.println(solve(s) ? "Yes" : "No");

    }
}