import java.util.Scanner;

class Main {
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    String S=sc.next();
    int N=S.length();
    String Moto[]=S.split("");
    String Hantai[]=new String[N];
    String H2[]=new String[(N-1)/2];
    String H3[]=new String[(N+5)/2];
    boolean first=true;
    boolean second=true;
    boolean third=true;
    for(int i=0;i<N;i++){
      Hantai[i]=Moto[N-1-i];
    }
    for(int i=0;i<(N-1)/2;i++){
      H2[i]=Moto[(N-1)/2-1-i];
    }
    for(int i=0;i<(N+5)/2;i++){
      if(N==(N+3)/2){
        break;
      }
      H3[i]=Moto[N-1-i];
    }
    for(int i=0; i<N-1; i++){
      if(!(Moto[i].equals(Hantai[i]))) {first=false;
        break;}
      }
      for(int i=0;i<(N-1)/2-1;i++){
        if(!(Moto[i].equals(H2[i]))) {second=false;
          break;}

        }
        for(int i=0;i<(N+5)/2-1;i++){
          if(N==(N+3)/2){
            break;
          }
          if(!(Moto[i].equals(H3[i]))) {third=false;
            break;}
          }
          if(first&&second&&third){
            System.out.println("Yes");
          }else{
            System.out.println("No");
          }
        }
      }

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz