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 main() {
  var s string="No"
  fmt.Scanf("%s", &s)
  var n int = len(s)
  var strong string
  var s1,s2 string
  var n1,n2 int
  
  if n%2==0 || len(s)<3 || len(s)>99 {
    strong="No"
    fmt.Printf("%s", strong)
    return
  }
  
  for i:=0; i<(n/2); i++{
    if s[i:i+1]== s[n-i-1:n-i] {
    	strong="Yes"      
    }else{
      	strong="No"
      return
    }
  }
  
  s1=s[:(n-1)/2]
  n1=len(s1)

  for i:=0; i<(n1/2); i++{
    if s1[i:i+1]== s1[n1-i-1:n1-i] {
    	strong="Yes"      
    }else{
      	strong="No"
      	continue
    }
  }

  s2=s[(n+3)/2-1:n]
  n2=len(s2)

  for i:=0; i<(n2/2); i++{
    if s2[i:i+1]== s2[n2-i-1:n2-i] {
    	strong="Yes"      
    }else{
      	strong="No"
      continue
    }
  }
  
  fmt.Printf("%s", strong)
}