739 B | 739 chars
import sys
from math import sqrt, pi, sin, cos, factorial, ceil, floor
from datetime import datetime, timedelta
# sys.setrecursionlimit(10**7)
BLANK = " "
# inp = input
inp = lambda : sys.stdin.readline().rstrip()
mii = lambda x = BLANK : [*map(int,inp().split(x))]
mfi = lambda x = BLANK : [*map(float,inp().split(x))]
ii = lambda : int(inp())
fi = lambda : float(inp())
prt = print
def gcd(a, b): return gcd(b, a % b) if b > 0 else a
def lcm(a, b): return a * b // gcd(a, b)
def solve():
s = inp()
for i in range(1, len(s) + 1):
a = s[:i]
b = s[i:]
s2 = b + a
if s2[::-1] == s2:
return "yes"
return "no"
if __name__ == "__main__":
tc = 1
for t in range(1, tc+1):
ret = solve()
prt(ret)