import java.util.*;
import java.io.*; 

public class Main {
	static boolean isPalindrome(String sub) {
	String s = new StringBuilder(sub).reverse().toString(); 
	if(s.equals(sub)) {
		return true; 
	}
	return false; 
}
	public static void main(String... string) {
		InputReader in = new InputReader(System.in);
		String s = in.readString(); 
		if(isPalindrome(s) && isPalindrome( s.substring(0, (s.length()-1)/2)) && isPalindrome(s.substring((s.length()+3)/2-1,s.length()))){
			System.out.println("Yes"); 
			return; 
		}
		System.out.println("No"); 
	}
}
class InputReader {

	private InputStream stream;
	private byte[] buf = new byte[1024];
	private int curChar;
	private int numChars;
	private SpaceCharFilter filter;

	public InputReader(InputStream stream) {
		this.stream = stream;
	}

	public int read() {
		if (numChars == -1)
			throw new InputMismatchException();
		if (curChar >= numChars) {
			curChar = 0;
			try {
				numChars = stream.read(buf);
			} catch (IOException e) {
				throw new InputMismatchException();
			}
			if (numChars <= 0)
				return -1;
		}
		return buf[curChar++];
	}

	public int readInt() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		int res = 0;
		do {
			if (c < '0' || c > '9')
				throw new InputMismatchException();
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	public String readString() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		StringBuilder res = new StringBuilder();
		do {
			res.appendCodePoint(c);
			c = read();
		} while (!isSpaceChar(c));
		return res.toString();
	}

	public long readLong() {
		int c = read();
		while (isSpaceChar(c)) {
			c = read();
		}
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		long res = 0;
		do {
			if (c < '0' || c > '9') {
				throw new InputMismatchException();
			}
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}
	
	public boolean isSpaceChar(int c) {
		if (filter != null)
			return filter.isSpaceChar(c);
		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	}

	public String next() {
		return readString();
	}

	public interface SpaceCharFilter {
		public boolean isSpaceChar(int ch);
	}
}

class OutputWriter {
	private final PrintWriter writer;

	public OutputWriter(OutputStream outputStream) {
		writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
	}

	public OutputWriter(Writer writer) {
		this.writer = new PrintWriter(writer);
	}

	public void print(Object... objects) {
		for (int i = 0; i < objects.length; i++) {
			if (i != 0)
				writer.print(' ');
			writer.print(objects[i]);
		}
	}

	public void println(Object... objects) {
		print(objects);
		writer.println();
	}

	public void close() {
		writer.close();
	}

	public void flush() {
		writer.flush();
	}

}

class Utils {
/////////////////////////////////////////////////////////////////////////////////////////////
	
///////////////////////////////  HEAP SORT ALGORITHM ////////////////////////////////////////////
	
	static void heapSort(int arr[]) { 
		build_maxheap(arr,arr.length);
		for(int i = arr.length-1; i>=1; i--) {
			Utils.swapArray(arr, 0, i); 
			max_heapify(arr,0,i);
		}
	}
	

	static void build_maxheap(int Arr[], int N) {
		for (int i = N/2; i >= 0; i--) {
			max_heapify(Arr, i, N);
		}
	}

	static void max_heapify(int Arr[], int i, int N) {
		int largest = i;
		int left = 2 * i + 1; // left child
		int right = 2 * i + 2; // right child
		if (left < N && Arr[left] > Arr[i])
			largest = left;
		else
			largest = i;
		if (right < N && Arr[right] > Arr[largest])
			largest = right;
		if (largest != i) {
			Utils.swapArray(Arr, i, largest);
			max_heapify(Arr, largest, N);
		}
	}
	
////////////////////////////////////////////////////////////////////////////////////////////
	
////////////////////////////  INDEX BASED ARRAY SWAPPING  //////////////////////////////////
	
    public static void swapArray(int arr[] , int xindex, int yindex) {
    	arr[xindex] = arr[xindex] ^ arr[yindex];
    	arr[yindex] = arr[xindex] ^ arr[yindex];
    	arr[xindex] = arr[xindex] ^ arr[yindex];
    }
    
////////////////////////////////////////////////////////////////////////////////////////////
    
/////////////////////////  READING INTEGER ARRAY  //////////////////////////////////////////
	public static int[] readIntArray(InputReader in, int size) {
		int[] array = new int[size];
		for (int i = 0; i < size; i++)
			array[i] = in.readInt();
		return array;
	}
	
////////////////////////////////////////////////////////////////////////////////////////////
}

//////////////////////////////////PAIR CLASS   ///////////////////////////////////////
class pair implements Comparable<pair> {
	int first;
	int second;

	pair(int first, int second) {
		this.first = first;
		this.second = second;
	}
    public int getFirst() {
    	return first; 
    }
    public int getSecond() {
    	return second; 
    }
	public String toString() {
		return first + " " + second;
	}

	public boolean equals(Object o) {
		return o instanceof pair && ((pair) o).first == first && ((pair) o).second == second;
	}

	public int compareTo(pair a) {
		return Integer.compare(second, a.second);
	}
}
//////////////////////////////////////////////////////////////////////////////////////

///////////////////   VERTEX CLASS FOR GRAPH  ///////////////////////////////////////
class vertex{
	 int index; 
	 long distance; 
	 int parent; 
	 Set<pair> adj; 
	 	 
	 vertex(int i){
		 index = i;
		 distance = Long.MAX_VALUE;
		 parent = i; 
		 adj = new HashSet<pair>();
	 }
} import java.util.*; util.* java import java.io.*; io.* java public class Main {
	static boolean isPalindrome(String sub) {
	String s = new StringBuilder(sub).reverse().toString(); 
	if(s.equals(sub)) {
		return true; 
	}
	return false; 
}
	public static void main(String... string) {
		InputReader in = new InputReader(System.in);
		String s = in.readString(); 
		if(isPalindrome(s) && isPalindrome( s.substring(0, (s.length()-1)/2)) && isPalindrome(s.substring((s.length()+3)/2-1,s.length()))){
			System.out.println("Yes"); 
			return; 
		}
		System.out.println("No"); 
	}
} Main static boolean isPalindrome(String sub) {
	String s = new StringBuilder(sub).reverse().toString(); 
	if(s.equals(sub)) {
		return true; 
	}
	return false; 
} isPalindrome {
	String s = new StringBuilder(sub).reverse().toString(); 
	if(s.equals(sub)) {
		return true; 
	}
	return false; 
} String s = new StringBuilder(sub).reverse().toString(); s new StringBuilder(sub).reverse().toString() new StringBuilder(sub).reverse().toString new StringBuilder(sub).reverse() new StringBuilder(sub).reverse new StringBuilder(sub) if(s.equals(sub)) {
		return true; 
	} s.equals(sub) s.equals s sub {
		return true; 
	} return true; true return false; false String sub sub public static void main(String... string) {
		InputReader in = new InputReader(System.in);
		String s = in.readString(); 
		if(isPalindrome(s) && isPalindrome( s.substring(0, (s.length()-1)/2)) && isPalindrome(s.substring((s.length()+3)/2-1,s.length()))){
			System.out.println("Yes"); 
			return; 
		}
		System.out.println("No"); 
	} main {
		InputReader in = new InputReader(System.in);
		String s = in.readString(); 
		if(isPalindrome(s) && isPalindrome( s.substring(0, (s.length()-1)/2)) && isPalindrome(s.substring((s.length()+3)/2-1,s.length()))){
			System.out.println("Yes"); 
			return; 
		}
		System.out.println("No"); 
	} InputReader in = new InputReader(System.in); in new InputReader(System.in) String s = in.readString(); s in.readString() in.readString in if(isPalindrome(s) && isPalindrome( s.substring(0, (s.length()-1)/2)) && isPalindrome(s.substring((s.length()+3)/2-1,s.length()))){
			System.out.println("Yes"); 
			return; 
		} isPalindrome(s) && isPalindrome( s.substring(0, (s.length()-1)/2)) && isPalindrome(s.substring((s.length()+3)/2-1,s.length())) isPalindrome(s) && isPalindrome( s.substring(0, (s.length()-1)/2)) && isPalindrome(s.substring((s.length()+3)/2-1,s.length())) isPalindrome(s) isPalindrome s isPalindrome( s.substring(0, (s.length()-1)/2)) isPalindrome s.substring(0, (s.length()-1)/2) s.substring s 0 (s.length()-1)/2 (s.length()-1) s.length() s.length s 1 2 isPalindrome(s.substring((s.length()+3)/2-1,s.length())) isPalindrome s.substring((s.length()+3)/2-1,s.length()) s.substring s (s.length()+3)/2-1 (s.length()+3)/2 (s.length()+3) s.length() s.length s 3 2 1 s.length() s.length s {
			System.out.println("Yes"); 
			return; 
		} System.out.println("Yes") System.out.println System.out System System.out "Yes" return; System.out.println("No") System.out.println System.out System System.out "No" String... string string class InputReader {

	private InputStream stream;
	private byte[] buf = new byte[1024];
	private int curChar;
	private int numChars;
	private SpaceCharFilter filter;

	public InputReader(InputStream stream) {
		this.stream = stream;
	}

	public int read() {
		if (numChars == -1)
			throw new InputMismatchException();
		if (curChar >= numChars) {
			curChar = 0;
			try {
				numChars = stream.read(buf);
			} catch (IOException e) {
				throw new InputMismatchException();
			}
			if (numChars <= 0)
				return -1;
		}
		return buf[curChar++];
	}

	public int readInt() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		int res = 0;
		do {
			if (c < '0' || c > '9')
				throw new InputMismatchException();
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	public String readString() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		StringBuilder res = new StringBuilder();
		do {
			res.appendCodePoint(c);
			c = read();
		} while (!isSpaceChar(c));
		return res.toString();
	}

	public long readLong() {
		int c = read();
		while (isSpaceChar(c)) {
			c = read();
		}
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		long res = 0;
		do {
			if (c < '0' || c > '9') {
				throw new InputMismatchException();
			}
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}
	
	public boolean isSpaceChar(int c) {
		if (filter != null)
			return filter.isSpaceChar(c);
		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	}

	public String next() {
		return readString();
	}

	public interface SpaceCharFilter {
		public boolean isSpaceChar(int ch);
	}
} InputReader private InputStream stream; stream private byte[] buf = new byte[1024]; buf new byte[1024] 1024 private int curChar; curChar private int numChars; numChars private SpaceCharFilter filter; filter public InputReader(InputStream stream) {
		this.stream = stream;
	} InputReader {
		this.stream = stream;
	} this.stream = stream this.stream this this.stream stream InputStream stream stream public int read() {
		if (numChars == -1)
			throw new InputMismatchException();
		if (curChar >= numChars) {
			curChar = 0;
			try {
				numChars = stream.read(buf);
			} catch (IOException e) {
				throw new InputMismatchException();
			}
			if (numChars <= 0)
				return -1;
		}
		return buf[curChar++];
	} read {
		if (numChars == -1)
			throw new InputMismatchException();
		if (curChar >= numChars) {
			curChar = 0;
			try {
				numChars = stream.read(buf);
			} catch (IOException e) {
				throw new InputMismatchException();
			}
			if (numChars <= 0)
				return -1;
		}
		return buf[curChar++];
	} if (numChars == -1)
			throw new InputMismatchException(); numChars == -1 numChars -1 1 throw new InputMismatchException(); new InputMismatchException() if (curChar >= numChars) {
			curChar = 0;
			try {
				numChars = stream.read(buf);
			} catch (IOException e) {
				throw new InputMismatchException();
			}
			if (numChars <= 0)
				return -1;
		} curChar >= numChars curChar numChars {
			curChar = 0;
			try {
				numChars = stream.read(buf);
			} catch (IOException e) {
				throw new InputMismatchException();
			}
			if (numChars <= 0)
				return -1;
		} curChar = 0 curChar 0 try {
				numChars = stream.read(buf);
			} catch (IOException e) {
				throw new InputMismatchException();
			} catch (IOException e) {
				throw new InputMismatchException();
			} IOException e {
				throw new InputMismatchException();
			} throw new InputMismatchException(); new InputMismatchException() {
				numChars = stream.read(buf);
			} numChars = stream.read(buf) numChars stream.read(buf) stream.read stream buf if (numChars <= 0)
				return -1; numChars <= 0 numChars 0 return -1; -1 1 return buf[curChar++]; buf[curChar++] buf curChar++ curChar public int readInt() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		int res = 0;
		do {
			if (c < '0' || c > '9')
				throw new InputMismatchException();
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	} readInt {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		int res = 0;
		do {
			if (c < '0' || c > '9')
				throw new InputMismatchException();
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	} int c = read(); c read() read while (isSpaceChar(c))
			c = read(); isSpaceChar(c) isSpaceChar c c = read() c read() read int sgn = 1; sgn 1 if (c == '-') {
			sgn = -1;
			c = read();
		} c == '-' c '-' {
			sgn = -1;
			c = read();
		} sgn = -1 sgn -1 1 c = read() c read() read int res = 0; res 0 do {
			if (c < '0' || c > '9')
				throw new InputMismatchException();
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c)); !isSpaceChar(c) isSpaceChar(c) isSpaceChar c {
			if (c < '0' || c > '9')
				throw new InputMismatchException();
			res *= 10;
			res += c - '0';
			c = read();
		} if (c < '0' || c > '9')
				throw new InputMismatchException(); c < '0' || c > '9' c < '0' c '0' c > '9' c '9' throw new InputMismatchException(); new InputMismatchException() res *= 10 res 10 res += c - '0' res c - '0' c '0' c = read() c read() read return res * sgn; res * sgn res sgn public String readString() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		StringBuilder res = new StringBuilder();
		do {
			res.appendCodePoint(c);
			c = read();
		} while (!isSpaceChar(c));
		return res.toString();
	} readString {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		StringBuilder res = new StringBuilder();
		do {
			res.appendCodePoint(c);
			c = read();
		} while (!isSpaceChar(c));
		return res.toString();
	} int c = read(); c read() read while (isSpaceChar(c))
			c = read(); isSpaceChar(c) isSpaceChar c c = read() c read() read StringBuilder res = new StringBuilder(); res new StringBuilder() do {
			res.appendCodePoint(c);
			c = read();
		} while (!isSpaceChar(c)); !isSpaceChar(c) isSpaceChar(c) isSpaceChar c {
			res.appendCodePoint(c);
			c = read();
		} res.appendCodePoint(c) res.appendCodePoint res c c = read() c read() read return res.toString(); res.toString() res.toString res public long readLong() {
		int c = read();
		while (isSpaceChar(c)) {
			c = read();
		}
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		long res = 0;
		do {
			if (c < '0' || c > '9') {
				throw new InputMismatchException();
			}
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	} readLong {
		int c = read();
		while (isSpaceChar(c)) {
			c = read();
		}
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		long res = 0;
		do {
			if (c < '0' || c > '9') {
				throw new InputMismatchException();
			}
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	} int c = read(); c read() read while (isSpaceChar(c)) {
			c = read();
		} isSpaceChar(c) isSpaceChar c {
			c = read();
		} c = read() c read() read int sgn = 1; sgn 1 if (c == '-') {
			sgn = -1;
			c = read();
		} c == '-' c '-' {
			sgn = -1;
			c = read();
		} sgn = -1 sgn -1 1 c = read() c read() read long res = 0; res 0 do {
			if (c < '0' || c > '9') {
				throw new InputMismatchException();
			}
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c)); !isSpaceChar(c) isSpaceChar(c) isSpaceChar c {
			if (c < '0' || c > '9') {
				throw new InputMismatchException();
			}
			res *= 10;
			res += c - '0';
			c = read();
		} if (c < '0' || c > '9') {
				throw new InputMismatchException();
			} c < '0' || c > '9' c < '0' c '0' c > '9' c '9' {
				throw new InputMismatchException();
			} throw new InputMismatchException(); new InputMismatchException() res *= 10 res 10 res += c - '0' res c - '0' c '0' c = read() c read() read return res * sgn; res * sgn res sgn public boolean isSpaceChar(int c) {
		if (filter != null)
			return filter.isSpaceChar(c);
		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	} isSpaceChar {
		if (filter != null)
			return filter.isSpaceChar(c);
		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	} if (filter != null)
			return filter.isSpaceChar(c); filter != null filter null return filter.isSpaceChar(c); filter.isSpaceChar(c) filter.isSpaceChar filter c return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1; c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1 c == '\t' c == '\r' c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1 c == ' ' c ' ' c == '\n' c '\n' c == '\r' c '\r' c == '\t' c '\t' c == -1 c -1 1 int c c public String next() {
		return readString();
	} next {
		return readString();
	} return readString(); readString() readString public interface SpaceCharFilter {
		public boolean isSpaceChar(int ch);
	} SpaceCharFilter public boolean isSpaceChar(int ch); isSpaceChar int ch ch class OutputWriter {
	private final PrintWriter writer;

	public OutputWriter(OutputStream outputStream) {
		writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
	}

	public OutputWriter(Writer writer) {
		this.writer = new PrintWriter(writer);
	}

	public void print(Object... objects) {
		for (int i = 0; i < objects.length; i++) {
			if (i != 0)
				writer.print(' ');
			writer.print(objects[i]);
		}
	}

	public void println(Object... objects) {
		print(objects);
		writer.println();
	}

	public void close() {
		writer.close();
	}

	public void flush() {
		writer.flush();
	}

} OutputWriter private final PrintWriter writer; writer public OutputWriter(OutputStream outputStream) {
		writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
	} OutputWriter {
		writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
	} writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream))) writer new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream))) OutputStream outputStream outputStream public OutputWriter(Writer writer) {
		this.writer = new PrintWriter(writer);
	} OutputWriter {
		this.writer = new PrintWriter(writer);
	} this.writer = new PrintWriter(writer) this.writer this this.writer new PrintWriter(writer) Writer writer writer public void print(Object... objects) {
		for (int i = 0; i < objects.length; i++) {
			if (i != 0)
				writer.print(' ');
			writer.print(objects[i]);
		}
	} print {
		for (int i = 0; i < objects.length; i++) {
			if (i != 0)
				writer.print(' ');
			writer.print(objects[i]);
		}
	} for (int i = 0; i < objects.length; i++) {
			if (i != 0)
				writer.print(' ');
			writer.print(objects[i]);
		} int i = 0; int i = 0; i 0 i < objects.length i objects.length objects objects.length i++ i++ i {
			if (i != 0)
				writer.print(' ');
			writer.print(objects[i]);
		} {
			if (i != 0)
				writer.print(' ');
			writer.print(objects[i]);
		} if (i != 0)
				writer.print(' '); i != 0 i 0 writer.print(' ') writer.print writer ' ' writer.print(objects[i]) writer.print writer objects[i] objects i Object... objects objects public void println(Object... objects) {
		print(objects);
		writer.println();
	} println {
		print(objects);
		writer.println();
	} print(objects) print objects writer.println() writer.println writer Object... objects objects public void close() {
		writer.close();
	} close {
		writer.close();
	} writer.close() writer.close writer public void flush() {
		writer.flush();
	} flush {
		writer.flush();
	} writer.flush() writer.flush writer class Utils {
/////////////////////////////////////////////////////////////////////////////////////////////
	
///////////////////////////////  HEAP SORT ALGORITHM ////////////////////////////////////////////
	
	static void heapSort(int arr[]) { 
		build_maxheap(arr,arr.length);
		for(int i = arr.length-1; i>=1; i--) {
			Utils.swapArray(arr, 0, i); 
			max_heapify(arr,0,i);
		}
	}
	

	static void build_maxheap(int Arr[], int N) {
		for (int i = N/2; i >= 0; i--) {
			max_heapify(Arr, i, N);
		}
	}

	static void max_heapify(int Arr[], int i, int N) {
		int largest = i;
		int left = 2 * i + 1; // left child
		int right = 2 * i + 2; // right child
		if (left < N && Arr[left] > Arr[i])
			largest = left;
		else
			largest = i;
		if (right < N && Arr[right] > Arr[largest])
			largest = right;
		if (largest != i) {
			Utils.swapArray(Arr, i, largest);
			max_heapify(Arr, largest, N);
		}
	}
	
////////////////////////////////////////////////////////////////////////////////////////////
	
////////////////////////////  INDEX BASED ARRAY SWAPPING  //////////////////////////////////
	
    public static void swapArray(int arr[] , int xindex, int yindex) {
    	arr[xindex] = arr[xindex] ^ arr[yindex];
    	arr[yindex] = arr[xindex] ^ arr[yindex];
    	arr[xindex] = arr[xindex] ^ arr[yindex];
    }
    
////////////////////////////////////////////////////////////////////////////////////////////
    
/////////////////////////  READING INTEGER ARRAY  //////////////////////////////////////////
	public static int[] readIntArray(InputReader in, int size) {
		int[] array = new int[size];
		for (int i = 0; i < size; i++)
			array[i] = in.readInt();
		return array;
	}
	
////////////////////////////////////////////////////////////////////////////////////////////
} Utils static void heapSort(int arr[]) { 
		build_maxheap(arr,arr.length);
		for(int i = arr.length-1; i>=1; i--) {
			Utils.swapArray(arr, 0, i); 
			max_heapify(arr,0,i);
		}
	} heapSort { 
		build_maxheap(arr,arr.length);
		for(int i = arr.length-1; i>=1; i--) {
			Utils.swapArray(arr, 0, i); 
			max_heapify(arr,0,i);
		}
	} build_maxheap(arr,arr.length) build_maxheap arr arr.length arr arr.length for(int i = arr.length-1; i>=1; i--) {
			Utils.swapArray(arr, 0, i); 
			max_heapify(arr,0,i);
		} int i = arr.length-1; int i = arr.length-1; i arr.length-1 arr.length arr arr.length 1 i>=1 i 1 i-- i-- i {
			Utils.swapArray(arr, 0, i); 
			max_heapify(arr,0,i);
		} {
			Utils.swapArray(arr, 0, i); 
			max_heapify(arr,0,i);
		} Utils.swapArray(arr, 0, i) Utils.swapArray Utils arr 0 i max_heapify(arr,0,i) max_heapify arr 0 i int arr[] arr static void build_maxheap(int Arr[], int N) {
		for (int i = N/2; i >= 0; i--) {
			max_heapify(Arr, i, N);
		}
	} build_maxheap {
		for (int i = N/2; i >= 0; i--) {
			max_heapify(Arr, i, N);
		}
	} for (int i = N/2; i >= 0; i--) {
			max_heapify(Arr, i, N);
		} int i = N/2; int i = N/2; i N/2 N 2 i >= 0 i 0 i-- i-- i {
			max_heapify(Arr, i, N);
		} {
			max_heapify(Arr, i, N);
		} max_heapify(Arr, i, N) max_heapify Arr i N int Arr[] Arr int N N static void max_heapify(int Arr[], int i, int N) {
		int largest = i;
		int left = 2 * i + 1; // left child
		int right = 2 * i + 2; // right child
		if (left < N && Arr[left] > Arr[i])
			largest = left;
		else
			largest = i;
		if (right < N && Arr[right] > Arr[largest])
			largest = right;
		if (largest != i) {
			Utils.swapArray(Arr, i, largest);
			max_heapify(Arr, largest, N);
		}
	} max_heapify {
		int largest = i;
		int left = 2 * i + 1; // left child
		int right = 2 * i + 2; // right child
		if (left < N && Arr[left] > Arr[i])
			largest = left;
		else
			largest = i;
		if (right < N && Arr[right] > Arr[largest])
			largest = right;
		if (largest != i) {
			Utils.swapArray(Arr, i, largest);
			max_heapify(Arr, largest, N);
		}
	} int largest = i; largest i int left = 2 * i + 1; left 2 * i + 1 2 * i 2 i 1 int right = 2 * i + 2; right 2 * i + 2 2 * i 2 i 2 if (left < N && Arr[left] > Arr[i])
			largest = left;
		else
			largest = i; left < N && Arr[left] > Arr[i] left < N left N Arr[left] > Arr[i] Arr[left] Arr left Arr[i] Arr i largest = left largest left largest = i largest i if (right < N && Arr[right] > Arr[largest])
			largest = right; right < N && Arr[right] > Arr[largest] right < N right N Arr[right] > Arr[largest] Arr[right] Arr right Arr[largest] Arr largest largest = right largest right if (largest != i) {
			Utils.swapArray(Arr, i, largest);
			max_heapify(Arr, largest, N);
		} largest != i largest i {
			Utils.swapArray(Arr, i, largest);
			max_heapify(Arr, largest, N);
		} Utils.swapArray(Arr, i, largest) Utils.swapArray Utils Arr i largest max_heapify(Arr, largest, N) max_heapify Arr largest N int Arr[] Arr int i i int N N public static void swapArray(int arr[] , int xindex, int yindex) {
    	arr[xindex] = arr[xindex] ^ arr[yindex];
    	arr[yindex] = arr[xindex] ^ arr[yindex];
    	arr[xindex] = arr[xindex] ^ arr[yindex];
    } swapArray {
    	arr[xindex] = arr[xindex] ^ arr[yindex];
    	arr[yindex] = arr[xindex] ^ arr[yindex];
    	arr[xindex] = arr[xindex] ^ arr[yindex];
    } arr[xindex] = arr[xindex] ^ arr[yindex] arr[xindex] arr xindex arr[xindex] ^ arr[yindex] arr[xindex] arr xindex arr[yindex] arr yindex arr[yindex] = arr[xindex] ^ arr[yindex] arr[yindex] arr yindex arr[xindex] ^ arr[yindex] arr[xindex] arr xindex arr[yindex] arr yindex arr[xindex] = arr[xindex] ^ arr[yindex] arr[xindex] arr xindex arr[xindex] ^ arr[yindex] arr[xindex] arr xindex arr[yindex] arr yindex int arr[] arr int xindex xindex int yindex yindex /////////////////////////  READING INTEGER ARRAY  //////////////////////////////////////////
	public static int[] readIntArray(InputReader in, int size) {
		int[] array = new int[size];
		for (int i = 0; i < size; i++)
			array[i] = in.readInt();
		return array;
	} readIntArray {
		int[] array = new int[size];
		for (int i = 0; i < size; i++)
			array[i] = in.readInt();
		return array;
	} int[] array = new int[size]; array new int[size] size for (int i = 0; i < size; i++)
			array[i] = in.readInt(); int i = 0; int i = 0; i 0 i < size i size i++ i++ i array[i] = in.readInt(); array[i] = in.readInt() array[i] array i in.readInt() in.readInt in return array; array InputReader in in int size size class pair implements Comparable<pair> {
	int first;
	int second;

	pair(int first, int second) {
		this.first = first;
		this.second = second;
	}
    public int getFirst() {
    	return first; 
    }
    public int getSecond() {
    	return second; 
    }
	public String toString() {
		return first + " " + second;
	}

	public boolean equals(Object o) {
		return o instanceof pair && ((pair) o).first == first && ((pair) o).second == second;
	}

	public int compareTo(pair a) {
		return Integer.compare(second, a.second);
	}
} pair int first; first int second; second pair(int first, int second) {
		this.first = first;
		this.second = second;
	} pair {
		this.first = first;
		this.second = second;
	} this.first = first this.first this this.first first this.second = second this.second this this.second second int first first int second second public int getFirst() {
    	return first; 
    } getFirst {
    	return first; 
    } return first; first public int getSecond() {
    	return second; 
    } getSecond {
    	return second; 
    } return second; second public String toString() {
		return first + " " + second;
	} toString {
		return first + " " + second;
	} return first + " " + second; first + " " + second first + " " + second first " " second public boolean equals(Object o) {
		return o instanceof pair && ((pair) o).first == first && ((pair) o).second == second;
	} equals {
		return o instanceof pair && ((pair) o).first == first && ((pair) o).second == second;
	} return o instanceof pair && ((pair) o).first == first && ((pair) o).second == second; o instanceof pair && ((pair) o).first == first && ((pair) o).second == second o instanceof pair && ((pair) o).first == first && ((pair) o).second == second o instanceof pair o pair ((pair) o).first == first ((pair) o).first ((pair) o) ((pair) o).first first ((pair) o).second == second ((pair) o).second ((pair) o) ((pair) o).second second Object o o public int compareTo(pair a) {
		return Integer.compare(second, a.second);
	} compareTo {
		return Integer.compare(second, a.second);
	} return Integer.compare(second, a.second); Integer.compare(second, a.second) Integer.compare Integer second a.second a a.second pair a a Comparable class vertex{
	 int index; 
	 long distance; 
	 int parent; 
	 Set<pair> adj; 
	 	 
	 vertex(int i){
		 index = i;
		 distance = Long.MAX_VALUE;
		 parent = i; 
		 adj = new HashSet<pair>();
	 }
} vertex int index; index long distance; distance int parent; parent Set<pair> adj; adj vertex(int i){
		 index = i;
		 distance = Long.MAX_VALUE;
		 parent = i; 
		 adj = new HashSet<pair>();
	 } vertex {
		 index = i;
		 distance = Long.MAX_VALUE;
		 parent = i; 
		 adj = new HashSet<pair>();
	 } index = i index i distance = Long.MAX_VALUE distance Long.MAX_VALUE Long Long.MAX_VALUE parent = i parent i adj = new HashSet<pair>() adj new HashSet<pair>() int i i public class Main {
	static boolean isPalindrome(String sub) {
	String s = new StringBuilder(sub).reverse().toString(); 
	if(s.equals(sub)) {
		return true; 
	}
	return false; 
}
	public static void main(String... string) {
		InputReader in = new InputReader(System.in);
		String s = in.readString(); 
		if(isPalindrome(s) && isPalindrome( s.substring(0, (s.length()-1)/2)) && isPalindrome(s.substring((s.length()+3)/2-1,s.length()))){
			System.out.println("Yes"); 
			return; 
		}
		System.out.println("No"); 
	}
} public class Main {
	static boolean isPalindrome(String sub) {
	String s = new StringBuilder(sub).reverse().toString(); 
	if(s.equals(sub)) {
		return true; 
	}
	return false; 
}
	public static void main(String... string) {
		InputReader in = new InputReader(System.in);
		String s = in.readString(); 
		if(isPalindrome(s) && isPalindrome( s.substring(0, (s.length()-1)/2)) && isPalindrome(s.substring((s.length()+3)/2-1,s.length()))){
			System.out.println("Yes"); 
			return; 
		}
		System.out.println("No"); 
	}
} Main
import java.util.*;
import java.io.*; 

public class Main {
	static boolean isPalindrome(String sub) {
	String s = new StringBuilder(sub).reverse().toString(); 
	if(s.equals(sub)) {
		return true; 
	}
	return false; 
}
	public static void main(String... string) {
		InputReader in = new InputReader(System.in);
		String s = in.readString(); 
		if(isPalindrome(s) && isPalindrome( s.substring(0, (s.length()-1)/2)) && isPalindrome(s.substring((s.length()+3)/2-1,s.length()))){
			System.out.println("Yes"); 
			return; 
		}
		System.out.println("No"); 
	}
}
class InputReader {

	private InputStream stream;
	private byte[] buf = new byte[1024];
	private int curChar;
	private int numChars;
	private SpaceCharFilter filter;

	public InputReader(InputStream stream) {
		this.stream = stream;
	}

	public int read() {
		if (numChars == -1)
			throw new InputMismatchException();
		if (curChar >= numChars) {
			curChar = 0;
			try {
				numChars = stream.read(buf);
			} catch (IOException e) {
				throw new InputMismatchException();
			}
			if (numChars <= 0)
				return -1;
		}
		return buf[curChar++];
	}

	public int readInt() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		int res = 0;
		do {
			if (c < '0' || c > '9')
				throw new InputMismatchException();
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}

	public String readString() {
		int c = read();
		while (isSpaceChar(c))
			c = read();
		StringBuilder res = new StringBuilder();
		do {
			res.appendCodePoint(c);
			c = read();
		} while (!isSpaceChar(c));
		return res.toString();
	}

	public long readLong() {
		int c = read();
		while (isSpaceChar(c)) {
			c = read();
		}
		int sgn = 1;
		if (c == '-') {
			sgn = -1;
			c = read();
		}
		long res = 0;
		do {
			if (c < '0' || c > '9') {
				throw new InputMismatchException();
			}
			res *= 10;
			res += c - '0';
			c = read();
		} while (!isSpaceChar(c));
		return res * sgn;
	}
	
	public boolean isSpaceChar(int c) {
		if (filter != null)
			return filter.isSpaceChar(c);
		return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	}

	public String next() {
		return readString();
	}

	public interface SpaceCharFilter {
		public boolean isSpaceChar(int ch);
	}
}

class OutputWriter {
	private final PrintWriter writer;

	public OutputWriter(OutputStream outputStream) {
		writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(outputStream)));
	}

	public OutputWriter(Writer writer) {
		this.writer = new PrintWriter(writer);
	}

	public void print(Object... objects) {
		for (int i = 0; i < objects.length; i++) {
			if (i != 0)
				writer.print(' ');
			writer.print(objects[i]);
		}
	}

	public void println(Object... objects) {
		print(objects);
		writer.println();
	}

	public void close() {
		writer.close();
	}

	public void flush() {
		writer.flush();
	}

}

class Utils {
/////////////////////////////////////////////////////////////////////////////////////////////
	
///////////////////////////////  HEAP SORT ALGORITHM ////////////////////////////////////////////
	
	static void heapSort(int arr[]) { 
		build_maxheap(arr,arr.length);
		for(int i = arr.length-1; i>=1; i--) {
			Utils.swapArray(arr, 0, i); 
			max_heapify(arr,0,i);
		}
	}
	

	static void build_maxheap(int Arr[], int N) {
		for (int i = N/2; i >= 0; i--) {
			max_heapify(Arr, i, N);
		}
	}

	static void max_heapify(int Arr[], int i, int N) {
		int largest = i;
		int left = 2 * i + 1; // left child
		int right = 2 * i + 2; // right child
		if (left < N && Arr[left] > Arr[i])
			largest = left;
		else
			largest = i;
		if (right < N && Arr[right] > Arr[largest])
			largest = right;
		if (largest != i) {
			Utils.swapArray(Arr, i, largest);
			max_heapify(Arr, largest, N);
		}
	}
	
////////////////////////////////////////////////////////////////////////////////////////////
	
////////////////////////////  INDEX BASED ARRAY SWAPPING  //////////////////////////////////
	
    public static void swapArray(int arr[] , int xindex, int yindex) {
    	arr[xindex] = arr[xindex] ^ arr[yindex];
    	arr[yindex] = arr[xindex] ^ arr[yindex];
    	arr[xindex] = arr[xindex] ^ arr[yindex];
    }
    
////////////////////////////////////////////////////////////////////////////////////////////
    
/////////////////////////  READING INTEGER ARRAY  //////////////////////////////////////////
	public static int[] readIntArray(InputReader in, int size) {
		int[] array = new int[size];
		for (int i = 0; i < size; i++)
			array[i] = in.readInt();
		return array;
	}
	
////////////////////////////////////////////////////////////////////////////////////////////
}

//////////////////////////////////PAIR CLASS   ///////////////////////////////////////
class pair implements Comparable<pair> {
	int first;
	int second;

	pair(int first, int second) {
		this.first = first;
		this.second = second;
	}
    public int getFirst() {
    	return first; 
    }
    public int getSecond() {
    	return second; 
    }
	public String toString() {
		return first + " " + second;
	}

	public boolean equals(Object o) {
		return o instanceof pair && ((pair) o).first == first && ((pair) o).second == second;
	}

	public int compareTo(pair a) {
		return Integer.compare(second, a.second);
	}
}
//////////////////////////////////////////////////////////////////////////////////////

///////////////////   VERTEX CLASS FOR GRAPH  ///////////////////////////////////////
class vertex{
	 int index; 
	 long distance; 
	 int parent; 
	 Set<pair> adj; 
	 	 
	 vertex(int i){
		 index = i;
		 distance = Long.MAX_VALUE;
		 parent = i; 
		 adj = new HashSet<pair>();
	 }
}
