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 C# (Mono 4.6.2.0) (judge verdict: Wrong Answer)

using System;

class kaibun
{
    static void Main(string[] args)
    {
        string src = Console.ReadLine();
        string[] inputA = src.Split(); ;
        int Len = src.Length - 1;
        int set = Len / 2;
        int seta = set + 1;
        string[] v = new string[src.Length];
        char[] c = new char[set];
        char[] d = new char[set];
        for (int i = 1; i <= set; i++)
        {
            c[i - 1] = src[i - 1];
        }
        for (int x = src.Length - 1; x >= set + 1; x--)
        {
            d[x - seta] = src[x - seta];
        }
        string cs = new string(c);
        string cs1 = cs.TrimEnd(' ');
        string ds = new string(d);
        string ds1 = ds.Trim(' ');
        if (cs1 == ds1)
        {
            Console.WriteLine("Yes");
        }
        else
        {
            Console.WriteLine("No");
        }
        
    }
}