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 Go (1.6) (judge verdict: Wrong Answer)

package main

import (
    "fmt"
)


func Reverse(s string) string {
    runes := []rune(s)
    for i, j := 0, len(runes)-1; i < j; i, j = i+1, j-1 {
        runes[i], runes[j] = runes[j], runes[i]
    }
    return string(runes)
}

func main() {
    var str, test1, test2 string
    fmt.Scan(&str)
  
    var length int = len(str)
  
    for index, s := range str {
        if index < (length-1)/2 {
            test1 += string(s)
        }
        
        if index > (index+3)/2 && index < length {
            test2 += string(s)
        }
    }
    
    var rev1 string = Reverse(test1)
    var rev2 string = Reverse(test2)
    if test1 != rev1 || test2 != rev2 || length < 3 || length > 99 {
        fmt.Println("No")
    } else {
        fmt.Println("Yes")
    }
}