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):
N=input()
print(["No","Yes"][N==N[::-1]])

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

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

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


if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

Solution (Python):

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

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

Solution (Python):



def main():
    """Function."""
    n = str(input())
    if n == n[-1]+n[-2]+n[-3]:
        print("Yes")
    else:
        print("No")


if __name__ == "__main__":
    main()

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

Solution (Python):
from statistics import mean, median,variance,stdev
import sys
import math



a = input()





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

Solution (Python):
a=[0,0,0]
b=int(input())
a[0]=(b-b%100)/100
a[1]=b-a[0]*100-b%10*10
a[2]=b%10
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 = int(input())

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

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

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

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

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

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

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

Solution (Python):
A = input()

B = A[::-1]
flag = True
for i in range(len(A)):
    if A[i] != B[i]:
        flag = False
        break

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

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

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

Solution (Python):




"""
https://beta.atcoder.jp/contests/abc070/tasks/abc070_a
"""

import sys
import math
from inspect import currentframe

def debug(*args):
    names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}
    print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args), file=sys.stderr)

N = int(input())

if str(N)[0] == str(N)[2]:
    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 == N[::-1]:
    print('Yes')
else:
    print('No')

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

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

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

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

Solution (Python):
a=input()

b=list(a)

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

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

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

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

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

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

Solution (Python):
N = input().rstrip()
n2 = N[::-1]

print('Yes' if N == n2 else'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):
A = input()

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

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

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

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

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

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

Solution (Python):
N = raw_input()
print "Yes" if N == "".join(reversed(N)) else "No"

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

Solution (Python):
s=input();print('YNeos'[s!=s[::-1]::2])

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

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

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

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

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

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

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

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

Solution (Python):
N = 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):
N = input()

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

Solution (Python):
n_str = input()

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

Solution (Python):
n = input()

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

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

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

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

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

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

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

Solution (Python):

N = input()
print(["No", "Yes"][N[0]==N[2]])

Solution (Python):

N = input()
print(["No", "Yes"][N==N[::-1]])

Solution (Python):
inputS = input()
listN = list(str(inputS))
listM = list(str(inputS))
listM.reverse()
if listN == listM:
    print("Yes")
else:
    print("No")

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

a = N//100
b = N-(N//10)*10

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

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

Solution (Python):
print("YNeos"[not int(input())%101 in range(0,100,10)::2])

Solution (Python):
print("Yes" if int(input())%101 in range(0,100,10) else "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 = int(input())

n100 = n // 100
n1 = (n % 100) % 10




if n100 == n1:
    print("Yes")

else:
    print("No")

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

Solution (Python):
s=input();print('YNeos'[s!=s[::-1]::2])

Solution (Python):
s=input();print('YNeos'[s!=s[::-1]::2])

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

Solution (Python):
a = input()
print('Yes' if a == a[::-1] else '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[0] == n[-1]:
    print('Yes')
else:
    print('No')

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

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

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

Solution (Python):
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]

def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def main():
    N = input()
    if N == N[::-1]:
        print(Yes)
    else:
        print(No)


if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):
a=input();print("YNeos"[a[0]!=a[2]::2])

Solution (Python):
N=list(input())
flag=1
for i in range(len(N)):
    if N[i]!=N[-i-1]:
        flag=0
print("Yes" if flag else "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()
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):
x,y,z=map(int, input())
if x==z:
	print("Yes")
else:
	print("No")

Solution (Python):
import sys
import math
import collections
import itertools
import array
import inspect


sys.setrecursionlimit(10000)



def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))



def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]




dp = None


def main():
    N = input()

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


main()

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

Solution (Python):
N=str(input())
if(N==N[::-1]):
  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()
RN = N[::-1]
if N == RN:
    print('Yes')
else:
    print('No')

Solution (Python):

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

Solution (Python):
n = input()

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

Solution (Python):
s=input()

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

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

Solution (Python):
S=input()
if S==S[::-1]:
  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):
D = input()
if D[0] == D[2]:
    print("Yes")
else:
    print("No")

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

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

Solution (Python):

n = str(raw_input())  

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

Solution (Python):
import sys
n = list(input())
if n[0] == n[2]:
    print('Yes')
else:
    print('No')
sys.exit(0)

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

Solution (Python):
s = input()
if s[:1] == s[2:]:
    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()
if s[0] == s[2]:
  print("Yes")
else:
  print("No")

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

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

Solution (Python):
s = input()
if s == s[::-1]:
    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[-1] else "No")

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

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

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

Solution (Python):
n_str = input()

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

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

Solution (Python):
N = list(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 == n[::-1]) else 'No')

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

Solution (Python):
N = input()

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

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

Solution (Python):
N = input()
for idx in range(len(N) // 2):
  if N[idx] != N[-1 - idx]:
    print('No')
    exit()
print('Yes')

Solution (Python):

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

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

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

Solution (Python):
N = input()

top = N[0]
bottom = N[2]

if top == bottom:
    print('Yes')
else:
    print('No')

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

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

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

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

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

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

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

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

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

Solution (Python):
x=input()
print(['No','Yes'][x==x[::-1]])

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 = str(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):


N = input()

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

Solution (Python):
n=list(input())
if n==n[::-1]:
    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()
print("Yes" if n==n[::-1] else 'No')

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

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

Solution (Python):


n = input()
print(['Yes', 'No'][n[0] != n[2]])

Solution (Python):
x=input()
print("Yes" if x[0]==x[2] else "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 == N[::-1] else "No")

Solution (Python):
print(["Yes","No"][(lambda x:bool(x/100-x%10))(input())])

Solution (Python):
print(["Yes","No"][(lambda x:bool(x//100-x%10))(input())])

Solution (Python):
print(["Yes","No"][(lambda x:(abs(x//100-x%10)+99)//100)(input())])

Solution (Python):
N = input()

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

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

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

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

Solution (Python):
N = input()

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

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

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

Solution (Python):
def isP (s):
    n = len(s)
    for i in range(0, int(n/2)):
        if s[i] != s[n-i-1]:
            return False
    return True

S = input()

result = "Yes" if isP(S) else "No"

print(result)

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

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

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

Solution (Python):
n = int(raw_input())
print ['No', 'Yes'][n % 10 is n / 100]

Solution (Python):


n = input()

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

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

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

Solution (Python):
def judge(s):
	if s[0] == s[2]: return 'Yes'
	else: return 'No'

print judge(raw_input())

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

Solution (Python):
a=""
a=raw_input()
if a[0]==a[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[::] == N[::-1] else "No")

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

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

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

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

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

Solution (Python):
a=input()
if list(a) ==list(reversed(a)): print('Yes')
else: print('No')

Solution (Python):
N = input()

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

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

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

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

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

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

Solution (Python):
n = input()
flag = False
for i in range(len(n)//2):
    if n[i] != n[-(i+1)]:
        flag = True

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

Solution (Python):
N = input()
R = ''
for i in range(len(N)):
    R += N[-(i+1)]
if R == N:
    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[0] == n[2]:
	print('Yes')
else:
	print('No')

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

Solution (Python):
a = str(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[0]==N[2]:
    print("Yes")
else:
    print("No")

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

Solution (Python):
import math
import sys

def getinputdata():

    
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()

n = arr_data[0][0]


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

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

Solution (Python):
N = input()

NS = int(N)
NR = int(''.join(reversed(list(N))))

print('Yes' if NS == NR else 'No')

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

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

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

Solution (Python):





if __name__ == '__main__':
    number = input()

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

Solution (Python):

N = input()
print(['Yes', 'No'][N != N[::-1]])

Solution (Python):

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

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

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

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):
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[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[0] == n[2]:
  print("Yes")
else:
  print("No")

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

Solution (Python):
s = input()

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

Solution (Python):
n=list(map(int,input()))
if n[0]==n[2]:
    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[::-1] else 'No')

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

Solution (Python):
n = input()

def parin(s):
    while len(s) > 1:
        if s[0] == s[-1]:
            s = s[1:-1]
        else:
            return False
    return True
if parin(n):
    print("Yes")
else:
    print("No")

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


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

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

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

Solution (Python):
n = input()

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

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

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

Solution (Python):
n = input()
import sys
for i in range(len(n)//2):
    if n[i] != n[len(n)-1-i]:
        print('No')
        sys.exit(0)

print('Yes')

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

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

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

Solution (Python):
print(("Yes","No")[len(set(input()[::2]))-1])

Solution (Python):
n=list(map(int,input()))
re=n[::-1]
for i in range(len(n)):
    if n[i]==re[i]:
        print("Yes")
        break
    else:
        print("No")
        break

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

Solution (Python):


N = list(map(int, list(input())))

ans = "Yes"
for top in range(len(N)):
    last = len(N) - 1 - top
    
    if top >= last:
        break

    if N[top] != N[last]:
        ans = "No"
        break
    
print(ans)

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

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

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

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

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

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

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

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

Solution (Python):
n = list(int(i) for i in 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()
lst = list(N)
if lst[0] == lst[2]:
    print("Yes")
else:
    print("No")

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

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

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

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

Solution (Python):
n=int(input())
a1 = n % 10
a2 = (n - a1) % 100
a3 = (n - a1 - a2) / 100
if a1 == a3:
    print("Yes")
else:
    print("No")

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

Solution (Python):
N = list(input())
if N[0] == N[2]:
    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[0] == s[2] else "No")

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

Solution (Python):
import math

num = int(input())
print("Yes" if math.floor(num/100) == num%10 else "No")

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

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

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

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

Solution (Python):
N = input()
A = int(N[0])
B = int(N[1])
C = int(N[2])
if A==C:
 print("Yes")
else:
 print("No")

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

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

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

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

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

Solution (Python):
n = input()

a = [i for i in n]
b = [i for i in reversed(n)]

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

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

Solution (Python):
if __name__ == '__main__':
    N = int(input())
    a = int(N/100)
    b = int(N/10)-a*10
    c = N - (a*100 + b*10)
    ans = c*100 + b*10 + a
    if ans == N:
        print('Yes')
    else:
        print('No')

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

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

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

Solution (Python):
print "Yes" if (lambda x: x == x[::-1])(raw_input()) else "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()
if N[0] == N[-1]:
    print("Yes")
else:
    print("No")

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

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

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

Solution (Python):
n = int(input())
a = 0
for i in range(1,10):
	if 100 * i <= n:
		a += 1
if a == n % 10:
	print('Yes')
else:
	print('No')

Solution (Python):
from collections import defaultdict
from itertools import product, groupby
from math import pi
from collections import deque
from bisect import bisect, bisect_left, bisect_right
INF = 10 ** 10


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


if __name__ == '__main__':
    main()

Solution (Python):


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

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

Solution (Python):
S=list(map(int, input()))

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

Solution (Python):

"""
"""


def is_palindromic(num_txt):
    return num_txt[0] == num_txt[-1]


def main():
    num_txt = input().strip()
    result = is_palindromic(num_txt)
    if result:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
a=N//100
b=(N-a*100)//10
c=N-a*100-b*10
if a == c:
    print("Yes\n")
else:
    print("No\n")

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

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

Solution (Python):
def solve(): 
    n = list(input())
    tmp = n.copy()
    tmp.reverse()
    if n == tmp:
        print("Yes")
    else:
        print("No")
        
        
solve()

Solution (Python):
line = raw_input()
if line == line[2] + line[1] + line[0]:
    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):
N = input()
if N[0] == N[2]:
    print('Yes')
else:
    print('No')