Problem:
Score : 200 points

Problem Statement

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.

Sample Input 1

akasaka

Sample Output 1

Yes

S is akasaka.

The string formed by the 1-st through the 3-rd characters is aka.

The string formed by the 5-th through the 7-th characters is aka.
All of these are palindromes, so S is a strong palindrome.

Sample Input 2

level

Sample Output 2

No

Sample Input 3

atcoder

Sample Output 3

No

Solution in Ruby (2.7.1) (judge verdict: Runtime Error)

s = gets.chomp.split("").map(&:to_s);
sl=s.length

ans = "Yes"


ck1 = s.slice(0..(sl/2)-1)
ck2 = s.slice(((sl/2)+1)..sl-1).reverse

if (ck1!=ck2) then
	ans = "No"
end

#check2
s2 = s.slice(0..(sl/2)-1)
s2l=s2.length

if s2l%2==0 then
	ck3 = s2.slice(0..(s2l/2))
	ck4 = s2.reverse.slice(0..(s2l/2))
	if ck3 != ck4 then
		ans ="No"
	end

else
	ck3 = s2.slice(0..(s2l/2)-1)
	ck4 = s2.revers.slice(0..(s2l/2)-1)
	if ck3 != ck4 then
		ans ="No"
	end
end

puts ans