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: Wrong Answer)

#include<bits/stdc++.h>
using namespace std;



int main()
{
    string s;
    cin>>s;


    int n=s.size();

    int x=(n-1)/2;


    string s2=string(s.rbegin(),s.rend());


    string s3(s.begin(),s.begin()+x);
    string s4(s.begin() + (n+3)/2 -1,s.end());

    string s5=string(s3.rbegin(),s3.rend());
    string s6=string(s4.rbegin(),s4.rend());

    int tmp1=0,tmp2=0,tmp3=0;
    if(s3==s5){
        tmp1=1;
    }
    if(s4==s6){
        tmp2=2;
    }
    if(s==s2){
        tmp3=3;
    }

    if(tmp1==1 && tmp2==1 && tmp3==1){
        cout<<"Yes"<<endl;
    }else{
    cout<<"No"<<endl;
    }


  //  cout<<s3<<endl;
//    cout<<s4<<endl;


    return 0;
}