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.io.*;
import java.util.*;
public class Main {

	public static void main(String[] args) {
		// TODO Auto-generated method stub
		Scanner inputs = new Scanner(System.in);
		String s = inputs.next();
		int end = 3;
		boolean huh = true;
		int len1 = (s.length()-1)/2;
		int len2 = (s.length()+3)/2;
		if(!palin(s.substring(0,len1))||!palin(s.substring(len2-1))||!palin(s)) {
			huh=false;
		}
		if(huh) {
			System.out.println("Yes");
		}
		else
			System.out.println("No");
	}
	public static boolean palin(String s) {
		String temp = "";
		for(int i=s.length()-1;i>=0;i--) {
			temp+=s.charAt(i);
		}
		if(temp.equals(s)) {
			return true;
		}
		return false;
	}
}
