Problem:
 Score : 100 points    Problem Statement You are given a three-digit positive integer N . Determine whether N is a palindromic number . Here, a palindromic number is an integer that reads the same backward as forward in decimal notation.      Constraints  100≤N≤999  N is an integer.         Input Input is given from Standard Input in the following format:  N       Output If N is a palindromic number, print Yes ; otherwise, print No .        Sample Input 1 575      Sample Output 1 Yes  N=575 is also 575 when read backward, so it is a palindromic number. You should print Yes .       Sample Input 2 123      Sample Output 2 No  N=123 becomes 321 when read backward, so it is not a palindromic number. You should print No .       Sample Input 3 812      Sample Output 3 No

Solution (Python):
x = input()
if x[0] == x[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
N = str(input())

if N == N[::-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys

N = input()

for i in range(len(N)):
  if N[i] != N[len(N)-1-i]:
    print("No")
    sys.exit()

print("Yes")

Solution (Python):
a = list(input())
rev_a = list(a)
rev_a.reverse()

if a == rev_a:
    print("Yes",end='')
else:
    print("No",end='')

Solution (Python):
a = list(input())
rev_a = list(a)
rev_a.reverse()

if a == rev_a:
    print("Yes")
else:
    print("No")

Solution (Python):
N = input()
print "Yes" if N / 100 == N % 10 else "No"

Solution (Python):
N = input()

for i in range(int(len(N) / 2 + 1)):
    if N[i] != N[len(N) - 1 - i]:
        print('No')
        exit()

print('Yes')

Solution (Python):
n = input()
print("Yes" if n[0] == n[2] else "No")

Solution (Python):
S = input()
print('Yes' if S == S[::-1] else 'No')

Solution (Python):
N=int(input())
if N//100==N%10:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys

for inp in map(str, [line.strip() for line in sys.stdin]):
	lenip = len(inp)
	if lenip%2==0:
		print "Yes" if inp[:lenip/2] == inp[lenip/2:][::-1] else "No"
	else:
		print "Yes" if inp[:lenip/2] == inp[(lenip+1)/2:][::-1] else "No"

Solution (Python):
s=input()
if s == ''.join(reversed(list(s))):
    print("Yes")
else:
    print("No")

Solution (Python):
num=list(raw_input())


if num==num[::-1]:
    print "Yes"
else:
    print "No"

Solution (Python):
S=input()
print('Yes' if S[0]==S[2] else 'No')

Solution (Python):
N=str(input())
if N[0]==N[2]:
  print("Yes")
else:
  print("No")

Solution (Python):
N = input()

n = len(N)
result="Yes"

for i in range(n//2):
    if N[i] != N[n-i-1]:
        result="No"
        break

print(result)

Solution (Python):
i=input()
print("Yes" if i[0]==i[2] else "No")

Solution (Python):
N = input()
if N[0] == N[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
def main():
    n = input()

    flag = True
    s, e = 0, len(n)
    while (s < e//2):
        if n[s] != n[e-s-1]:
            flag=False
            break
        s += 1
    if flag:
        print("Yes")
    else:
        print("No")
        

if __name__ == "__main__":
    main()

Solution (Python):

s = input()

print("Yes" if s[0] == s[2] else "No")

Solution (Python):
N = int (input( ))

N_100 = N // 100
N = N - 100 * N_100
N_10 = N // 10
N = N - 10 * N_10
N_1 = N

if  N_100 == N_1:
    print ('Yes')
else :
    print ('No')

Solution (Python):


A = int(input())

if(int(A/100) == int(A%10)):
    print("Yes")
else:
    print("No")

Solution (Python):
N = input()

if N[0] == N[-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
N = input()
str_N = str(N)
rev_N = str_N[::-1]

if str_N == rev_N:
    print('Yes')
else:
    print('No')

Solution (Python):
def main():
    N = input()
    
    
    
    if(N == N[::-1]):
        print("Yes")
    else:
        print("No")
    
if __name__=="__main__":
    main()

Solution (Python):
s = input()
a = len(s)
i = 0
for i in range(a):
    if s[i] == s[a - 1 - i]:
        b = 1
    else:
        b = 0
        break


if b == 1:
    print('Yes')
else:
    print('No')

Solution (Python):
i=raw_input()
if i==i[::-1]: print 'Yes'
else: print 'No'

Solution (Python):
s = input()
if s[0] == s[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
n = input()
if n[0] == n[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
if n[0] == n[-1]:
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()
ans = int(N) - int(N[::-1])
if ans == 0:
	print("Yes")
else:
	print("No")

Solution (Python):
if __name__ == '__main__':
    str = input()
    if str[0] == str[2]:
        print("Yes")
    else:
        print("No")

Solution (Python):
n = int(raw_input())
if n / 100 == n % 10:
    print 'Yes'
else:
    print 'No'

Solution (Python):
kaibun = str(input())


if kaibun == kaibun[::-1]:
	print('Yes')
else:
	print('No')

Solution (Python):
def getInput():
    separator = ' '
    ret_array = []
    while True:
        try:
            row = input().split(sep=separator)
            ret_array.append(row)
        except EOFError:
            break
    return ret_array


inp = getInput()
i = inp[0][0]

if i[0] == i[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
str = input()
if str == str[::-1]:
    print('Yes')
else:
    print('No')

Solution (Python):
def main():
    a = input()

    for i in range(len(a)//2):
        if a[i] != a[-i-1]:
            print('No')
            return
    print('Yes')
    return


if __name__ == '__main__':
    main()

Solution (Python):
n = input()
if n[0] == n[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
str1 = input()

if str1[0] == str1[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
N = input()
rev_N = list(N)[::-1]
if N == "".join(rev_N):
    print("Yes")
else:
    print("No")

Solution (Python):
def func(s):
    key = len(s)
    for i in range(len(s)):
        if s[key - i - 1] != s[i]:
            return -1
    return 0

s = raw_input()

n = func(s)

if n == 0:
    print "Yes"
else:
    print "No"

Solution (Python):
N = input()

if N[0] == N[2] :
    print("Yes")
else :
    print("No")

Solution (Python):
a=input()
if a[:1]==a[-1]:
	print("Yes")
else:
	print("No")

Solution (Python):
N = input()
if N[:1] == N[-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
N = input()
if N[:1] == N[-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
str=input()
if str[0]==str[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
if(n[0] == n[2]):
    print("Yes")
else:
    print("No")

Solution (Python):


def isPal(n):
    sum = 0
    while(n>0):
        rem = n % 10
        sum = (sum * 10) + rem
        n = n//10

    return sum

n = int(input().strip())

if(n == isPal(n)):print('Yes')
else:print('No')

Solution (Python):
a = input()
b = list(a)
c = ''
while b:
    c += b.pop()

if a==c:
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()
if N[0] == N[-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()

if n == n[::-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
num = input()
if num == num[::-1]:
	print("Yes")
else:
	print("No")

Solution (Python):
n = input()
r = n[::-1]
if n == r:
    print("Yes")
else:
    print("No")

Solution (Python):
N =input('')

if (N % 10) == (N / 100):
	print 'Yes'
else:
	print 'No'

Solution (Python):
n = input()
if n[0] == n[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
a = input()
b = a[::-1]

if a == b:
	print("Yes")
else :
	print("No")

Solution (Python):
N = input()
if N[0] == N[-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
N = input()
n=int(N)
n2=(n%10)*100
n2+=(n%100)-n%10
n2+=(n-n%100)/100
if n==n2 :
	print('Yes\n')
else:
	print('No\n')
quit()

Solution (Python):
n=input()
if n[0]==n[-1]:
  print('Yes')
else:
  print('No')

Solution (Python):
s = input()
if s == s[::-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
l = list(map(int, input().split()))

if l[0]//100 == l[0]%10:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
if(n[0]==n[2]):
    print("Yes")
else :
    print("No")

Solution (Python):
n = input()
if n == n[::-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
print("Yes" if(n[0]==n[2]) else "No")

Solution (Python):
s=input();print("Yes"if s==s[::-1]else"No")

Solution (Python):

userinput = input()

if userinput[0] == userinput[2]:
	print("Yes")

else:
	print("No")

Solution (Python):
N=input()
if N==N[::-1]:
 print('Yes')
else:
 print('No')

Solution (Python):
S=str(input())
Sr=S[::-1]
if Sr==S:
    print('Yes')
else:
    print('No')

Solution (Python):


n = raw_input()

if n[0] == n[-1]:
    print "Yes"
else:
    print "No"

Solution (Python):
n = list(input())
if n[0]==n[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
a=input()
b=''.join(reversed(a))
if(a==b):
  print('Yes')
else:
  print('No')

Solution (Python):

N = list(input())
if ''.join(N) == ''.join(reversed(N)):
    print('Yes')
else:
    print('No')

Solution (Python):
num = input()
if num[0] == num[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools

sys.setrecursionlimit(10**7)
inf = 10**1
gosa = 1.0 / 10**9
mod = 10**9 + 7

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()


def main():
    n = S()
    if n == n[::-1]:
        return 'Yes'


    return 'No'



print(main())

Solution (Python):
N = input()
print('Yes' if N == N[::-1] else 'No')

Solution (Python):
n = list(input())
r = n[::-1]

if(n==r):
    print("Yes")
else:
    print("No")

Solution (Python):
n=input()
print("Yes"  if n[0]==n[2] else "No")

Solution (Python):


n=raw_input()
if n[0]==n[-1]:
 print 'Yes'
else:
 print 'No'

Solution (Python):
s=input()
if s==s[::-1]:
  print("Yes")
else:
  print("No")

Solution (Python):
N = input()
if N == N[::-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
N = input()
if N == N[::-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
x=input()
y=list(x)
if y[0]==y[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
def kaibun(s):
    for i in range((len(s)+1)//2):
        if s[i] != s[-(i+1)]:
            return "No"
    return "Yes"


s = input()
print(kaibun(s))

Solution (Python):
n = input().rstrip()
if n[0]==n[2]:
	print("Yes")
else:
	print("No")

Solution (Python):
s = input()
if s[0:1] == s[2:3]:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys




def read_int_list():
    return list(map(int, input().split()))


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    n = read_str()
    if n == ''.join(list(reversed(n))):
        res = 'Yes'
    else:
        res = 'No'
    print(res)


main()

Solution (Python):
d = input()
print('Yes' if d == d[::-1] else 'No')

Solution (Python):
num = input()

print ('Yes' if num[0:1]==num[2:3] else 'No')

Solution (Python):
s=input()
if s[0] == s[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(raw_input())

if int(str(N)[::-1]) == N:
    print "Yes"
else:
    print "No"

Solution (Python):
n = input()
m = int(str(n)[::-1])
if(n == m):
  print 'Yes'
else:
  print 'No'

Solution (Python):
s = input()
if(s == s[::-1]) :
	print('Yes')
else:
	print('No')

Solution (Python):
N = input()
if N[:1] == N[-1]:
  print("Yes")
else:
  print("No")

Solution (Python):
a,_,b=input()
if a==b:
  print("Yes")
else:
  print("No")

Solution (Python):
N = str(input())
start = 0
end = len(N) - 1
result = True

while start < end: 
    if N[start] == N[end]: 
        start += 1
        end -= 1
    else:
        result = False
        break

if result:
	print("Yes")
else:
	print("No")

Solution (Python):


N = int(input())

if ( N == int(str(N)[::-1]) ):
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
n100 = int(N/100)
n1 = N - int(N/10) * 10
if n100 == n1:
    print("Yes")
else:
    print("No")

Solution (Python):
a = input()
a.split()

if(a[0] == a[2]):
  print("Yes")
else:
  print("No")

Solution (Python):
kaibun = input()
if "".join(reversed(kaibun)) == kaibun:
    print("Yes")
else:
    print("No")

Solution (Python):
N=input()
a=list(N)
b=[]
n=len(a)
for i in range(n):
 b.append(0)
count=0

for i in range(n):
  b[i]=a[n-1-i]

for i in range(n):
  if(a[i]==b[i]):
    count +=1

if(count==n):
  print("Yes")
else:
  print("No")

Solution (Python):
n = input()
print("Yes" if n[0] == n[2] else "No")

Solution (Python):
s = raw_input()
if s[0] == s[2]:
  print 'Yes'
else:
  print 'No'

Solution (Python):
def a():
    n = input()
    print('Yes' if n[0] == n[2] else 'No')

a()

Solution (Python):
N = str(input())
M = N[::-1]

if N == M:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys




def read_int_list():
    return list(map(int, input().split()))


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    n = read_int()
    if str(n)[0] == str(n)[-1]:
        res = 'Yes'
    else:
        res = 'No'
    print(res)


main()

Solution (Python):
n = int(input())
if (n//10//10) == (n%10%10):
    print('Yes')
else:
    print('No')

Solution (Python):
import sys

N = int(sys.stdin.readline())

firstD = N / 100
lastD = N % 10
if firstD == lastD:
	print 'Yes'
else:
	print 'No'

Solution (Python):
n = str(input())
print("Yes" if n == n[::-1] else "No")

Solution (Python):
n=input()
if n[0] == n[2]:
  print("Yes")
else:
  print("No")

Solution (Python):
s = input()
if s[-1] == s[0]:
   print("Yes")
else:
   print("No")

Solution (Python):
if __name__ == '__main__':
    STR = input()
    if STR[0:1] == STR[2:3]:
        print('Yes')
    else:
        print('No')

Solution (Python):
a = input()
print('Yes' if a[0]==a[2] else 'No')

Solution (Python):
s = input().strip()
if s[0] == s[-1]:
  print('Yes')
else:
  print('No')

Solution (Python):
n = int(input())
if n//100 == n%10:
    print('Yes')
else:
    print('No')

Solution (Python):
N=input()
S=N[2]+N[1]+N[0]
if N==S:
  print("Yes")
else:
  print("No")

Solution (Python):
a = input()
i = 0
n = 1
time = len(a)
ans = "Yes"
while i < time:
    if a[i] == a[-n]:
        pass
    else:
        ans = "No"
    i += 1
    n += 1
print(ans)

Solution (Python):
s = input()
print('Yes' if all(a == b for a,b in zip(s,reversed(s))) else 'No')

Solution (Python):
n = input()
r = n[::-1]
if n == r:
    print("Yes")
else:
    print("No")

Solution (Python):
n =int(input())
l = [int(d) for d in str(n)]


found = False
while len(l) >1 and not found:
    st = l.pop()
    end = l.pop(0)
    if st==end:
        found = False
    else:
        found = True

if not found:
    print('Yes')
else:
    print('No')

Solution (Python):
n = input()
rn = n[-1::-1]
print('Yes' if n == rn else 'No')

Solution (Python):
st=str(input())
if st[0] == st[-1]:
    	print("Yes")
else:
        print("No")

Solution (Python):
N = input()
a=list(str(N))
b=list(str(N))

a.reverse()



if a==b:
	print 'Yes'
else:
	print 'No'

Solution (Python):
a = raw_input()
if a[0] == a[2]:
	print('Yes')
else:
	print("No")

Solution (Python):
n = input()
l = len(n)
flag = True
for i in range(0, l):
    if n[i] != n[l - i - 1]:
        flag = False
        break
if flag:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
rev = ''.join(list(reversed(n)))
res = 'Yes' if int(n) == int(rev) else 'No'
print(res)

Solution (Python):
N=str(input())
if N[::-1]==N:
    print("Yes")
else:
    print("No")

Solution (Python):
N = list(map(int, (input())))
if N == N[::-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
n = []
msg = "Yes"
n += input()
for i in range(len(n)//2):
  if n[i] != n[-(i+1)]:
    msg = "No"
    break
print(msg)

Solution (Python):
n = input()
s = []
for i in range(len(n)):
    s.append(n[len(n)-1-i])
if(n=="".join(s)):
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
lens = len(s)

for i in range(int(lens/2)):
    if s[i] != s[lens-1]:
        print("No")
        exit()
print("Yes")

Solution (Python):
def Q1(x):
    value_reverse = int(str(x)[::-1])
    if x == value_reverse:
        return 'Yes'
    else:
        return 'No'
      
x=int(input())
print(Q1(x))

Solution (Python):
N = input()
if N[0] == N[2]:
    print ('Yes')
else:
    print ('No')

Solution (Python):
n = str(int(input()))

print("Yes" if n == n[::-1] else "No")

Solution (Python):
s = str(input())
if s == s[::-1]:
	print("Yes")
else:
	print("No")

Solution (Python):
N=input()
N1=N/100
N2=N/10-N1*10
N3=N-N1*100-N2*10

if N1==N3:
  print "Yes"
else:
  print "No"

Solution (Python):
n = input()
if n == n[::-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
a = input()
b = []

for i in range(len(a)):
    b.insert(0, a[i])
    
if list(a) == b:
    print("Yes")
else:
    print("No")

Solution (Python):
s = str(input())
if s == s[::-1]:
	print("Yes")
else:
	print("No")

Solution (Python):
n = input()
print('Yes' if n[0] == n[2] else 'No')

Solution (Python):



n = raw_input()

length = len(n)

status = 0

for i in range(length/2):
    if n[i] == n[length-1-i]:
        pass
    else:
        status = 1
        break

if status == 0:
    print 'Yes'
else:
    print 'No'

Solution (Python):
n = list(input())

if n==n[::-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
N = int(input())
N = str(N)
if N[::-1] == N:
  print('Yes')
else:
  print('No')

Solution (Python):


a = input()
if a[0] == a[-1]:
	print("Yes")
else:
	print("No")

Solution (Python):


n = int(input())

n = str(n)
n = list(n)

flag = 0
for i in range(len(n)//2):
    if n[i] == n[-(i+1)]:
        pass
    else:
        flag = 1

if flag == 0:
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()
Ninv = N[::-1]
if N == Ninv:
	print("Yes")
else:
	print("No")

Solution (Python):
N = (input())						

if N[0]==N[-1]:
	print("Yes")
else:
	print("No")

Solution (Python):
na = list(input())
nb = na[:]
nb.reverse()
if na == nb:
    print('Yes')
else:
    print('No')

Solution (Python):
if __name__ == '__main__':
    N = int(input())
    if N % 10 == int((N - (N % 100))/100):
        print("Yes")
    else:
        print("No")

Solution (Python):
k = int(input())
if int(k / 100) == k % 10:
	print("Yes")
else:
	print("No")

Solution (Python):
N = input()
if N == N[::-1]:
	print("Yes")
else:
	print("No")

Solution (Python):
n = input()
if n == n[::-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
if n == n[::-1]:
	print("Yes")
else:
	print("No")

Solution (Python):
S = input()
if S[0] == S[2]:
    print("Yes")
else:
    print("No")

Solution (Python):

def II(): return int(input())
def ILI(): return list(map(int, input().split()))


def read():
    N = input()
    return (N, )


def solve(N):
    rev = str(int("".join(reversed(N))))
    if N == rev:
        ans = "Yes"
    else:
        ans = "No"
    return ans


def main():
    params = read()
    print(solve(*params))


if __name__ == "__main__":
    main()

Solution (Python):


def main():
    n = int(input())

    if n // 100 == n % 10:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Solution (Python):
N = input()
if N[0] == N[2]: print("Yes")
else: print("No")

Solution (Python):
def main():
    N_str = input().strip()
    if N_str == N_str[::-1]:
        print("Yes")
    else:
        print("No")

if __name__ == '__main__':
    main()

Solution (Python):
n = list(input())
if n[0]==n[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
t=int(input())
if(t//100==t%10):
    print('Yes')
else:
    print('No')

Solution (Python):
N = input()

if N[0] == N[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
s=str(input())
s1=s[::-1]
if s==s1:
    print("Yes")
else:
    print("No")

Solution (Python):
x=str(int(input()))
if x[0]==x[-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
n = str(input())
if n[0] == n[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
a = input()
if a / 100 == a % 10:
  print "Yes"
else:
  print "No"

Solution (Python):
def main():
	n = int(input())
	a = n // 100
	b = n - (n // 10) * 10
	if a == b:
		print("Yes")
	else:
		print("No")
 
if __name__ == '__main__':
	main()

Solution (Python):
def ri(): return int(input())
def rli(): return list(map(int, input().split()))
def rls(): return list(input())
def pli(a): return "".join(list(map(str, a)))
def plis(a): return " ".join(list(map(str, a)))

N = input()
if(N[0] == N[2]):
    print("Yes")
else:
    print("No")

Solution (Python):
nm = int(input())
if str(nm) == str(nm)[::-1]:
    print('Yes')
else:
    print('No')

Solution (Python):
N=input()
print('Yes' if N==N[::-1] else 'No')

Solution (Python):
n=list(input())
if n[::-1]==n:
 print("Yes")
else:
 print("No")

Solution (Python):
N = str(input())

A = N[::-1]
if N == A:
    print("Yes")
else:
    print("No")

Solution (Python):
N = input()
if N[0] == N[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
def main():
    N = input()

    if N == N[::-1]:
        ans = 'Yes'
    else:
        ans = 'No'

    print(ans)

main()

Solution (Python):

s=raw_input()
print 'Yes' if s==s[::-1] else 'No'

Solution (Python):
N = input()
if N[0] == N[2]:
    print('Yes')
else:
    print('No')

Solution (Python):
a = input()
if a[0] == a[2]: print("Yes")
else: print("No")

Solution (Python):
N=input()
if N[0]==N[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
N=input()
if N[0]==N[2]:print('Yes')
else:
  print('No')

Solution (Python):
N = input()
if N == N[::-1]:
    print('Yes')
else:
    print('No')

Solution (Python):



import sys
import re
import math
import collections
import itertools
import functools

DEBUG = True
DEBUG = False

def dbg(*args):
    if DEBUG:
        print("DBG: ", file=sys.stderr, end="")
        print(*args, file=sys.stderr)



def main():
    N = int(input())
    s = str(N)
    print("Yes" if s == "".join(reversed(s)) else "No")

if __name__ == "__main__": main()

Solution (Python):
number = input()
number_reverse = number[::-1]
if number == number_reverse:
  print("Yes")
else:
  print("No")

Solution (Python):
s = raw_input()
print "Yes" if s == s[::-1] else "No"

Solution (Python):
n = input()
msg = "Yes" if n == n[::-1] else "No"
print(msg)

Solution (Python):
ins = input()
if ins == ins[::-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
s = input()
print("Yes" if s==s[::-1] else "No")

Solution (Python):
N = raw_input()
print "Yes" if N==N[::-1] else "No"

Solution (Python):
n=input()
print('Yes' if n[::-1]==n else 'No')

Solution (Python):
n = input().strip()
if n[0] == n[2]:
    print("Yes")
else:
    print("No")

Solution (Python):

a=input()
if a[0]==a[2]:
    print("Yes")
else:print("No")

Solution (Python):
a = input()

if a == a[::-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
N = raw_input()

if N == N[::-1]:
    print "Yes"
else:
    print "No"

Solution (Python):
s = input()
print("Yes" if s == s[::-1] else "No")

Solution (Python):
N = input()
if N[0] == N[-1]:
    print("Yes")
else:
    print("No")

Solution (Python):

s=raw_input()
for i in range(len(s)/2):
    if s[i]!=s[len(s)-i-1]:
        print "No"
        exit()
print "Yes"

print

Solution (Python):
N = input()
revN = N[::-1]

if int(N) == int(revN):
    print("Yes")
else:
    print("No")

Solution (Python):
def f():
    n=(input())
    if (n[0]==n[2]):    
        print("Yes")
    else:
        print('No')
f()

Solution (Python):
n = str(raw_input())

print("Yes" if n[0] == n[2] else "No")

Solution (Python):
n = input()
if n == n[::-1]:
    print('Yes')
else:
    print('No')

Solution (Python):
N=raw_input()
if N[0]==N[-1] :
    print 'Yes'
else :
    print 'No'

Solution (Python):
a = input()

if a[::-1] == a:
    print("Yes")
else:
    print("No")

Solution (Python):
S=input()
if S==S[::-1] :
  print("Yes")
else:
  print("No")

Solution (Python):
n=input()
print("Yes" if n[0]==n[2] else "No")

Solution (Python):
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

s = ns().strip()
if s == s[::-1]:
    print("Yes")
else:
    print("No")

Solution (Python):
n = input()
print("Yes" if n[0] == n[2] else "No")

Solution (Python):
n = raw_input()
if n[0] == n[2]: print "Yes"
else: print "No"

Solution (Python):
n = input()
if n == n[::-1]:
    print('Yes')
else:
    print('No')

Solution (Python):
N = raw_input()
print "Yes" if N[0] == N[2] else "No"