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++14 (GCC 5.4.1) (judge verdict: Runtime Error)

#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define rall(v) v.rbegin(),v.rend()
typedef long long ll;
#define _GLIBCXX_DEBUG
int main()	{
  string s;
  int count=0;
  reverse(all(s));
  string srev=s;
  reverse(all(s));
  if(s==srev)
    count++;
  int n=s.size();
  int a=(n-1)/2;
  int b=(n+3)/2;
  string str1=s.substr(0,a);
  reverse(all(str1));
  string str11=str1;
  reverse(all(str1));
  if(str1==str11)
    count++;
  string str2=s.substr(b,n-b+1);
  reverse(all(str2));
  string str22=str2;
  reverse(all(str2));
  if(str2==str22)
    count++;
  
  if(count==3)
    cout<<"Yes"<<endl;
  else
    cout<<"No"<<endl;
}