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):
import sys
import os

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

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


if __name__ == '__main__':
    main()

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 = int(input())
print("Yes" if n//100 == n%10 else "No")

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

Solution (Python):
n = input().strip()

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

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

Solution (Python):
A=int(input())
B=int(A/100)+(A%10)*100+(int(A/10)%10)*10
if A==B:
    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[0]==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):
a, b, c = input()
if a == c:
    print("Yes")
else:
    print("No")

Solution (Python):


N = input()

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

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

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 = input()

if n[0] == 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):
import sys

n = sys.stdin.readline().rstrip()

def main():
    ans = 'Yes' if n == n[::-1] else 'No'
    print(ans)

if __name__ ==  '__main__':
    main()

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

Solution (Python):
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

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

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

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

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

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

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

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

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

Solution (Python):
import math



a=input()

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

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

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

Solution (Python):
N = input()

rev_N = N[2] + N[1] + N[0]

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

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

Solution (Python):


import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

s = ns()

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

Solution (Python):
N=input()

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

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

Solution (Python):
s=input()
a=0 if s[0]==s[-1] else 1
print('YNeos'[a::2])

Solution (Python):
import math

N=input()

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

Solution (Python):
a,b,c=input()
print('Yes' if a==c 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):
a = input()

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

Solution (Python):
import sys
input = sys.stdin.readline

n = input().rstrip("\r\n")
ans = "Yes" if n[0]==n[2] else "No"
print(ans)

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

i = N//100
j = (N - 100*i)//10
k = (N - 100*i - 10*j)

print("Yes" if i == k else "No")

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

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

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

Solution (Python):

import sys


YES = "Yes"  
NO = "No"  


def solve(N: int):
    s = str(N)
    print(YES if s[0] == s[2] else NO)


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    solve(N)


if __name__ == '__main__':
    main()

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

if s == s[::-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()
rev_n = n[::-1]
if n == rev_n:
    print('Yes')
else:
    print('No')

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

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

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

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

if s == list(reversed(s)):
  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):
S=input()
M=S[::-1]
if S==M:
	print("Yes")
else:
	print("No")

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

Solution (Python):
n=int(input())
n1=list(str(n))
n2=n1.copy()
n2.reverse()
n3=int("".join(n2))
if n==n3:
    print("Yes")
else:
    print("No")

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

Solution (Python):
N=input()
n=[int(a) for a in N]
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):
x=input()
k=[]
t=[]
for i in range(len(x)):
	k.append(x[i])
for i in range(len(x)):
	t.append(x[len(x)-i-1])

if k==t:
	print('Yes')
else:
	print('No')

Solution (Python):
n =input()

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

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

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

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

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

Solution (Python):
N = input()

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

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

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

else:
  print('No')

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

Solution (Python):
N = input()
n = len(N)
ok = 1
for i in range(n):
    if N[i] == N[n-i-1]:
        continue
    ok = 0
    break
if ok:
    print("Yes")
else:
    print("No")

Solution (Python):
N = input()

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

Solution (Python):
import sys
input = sys.stdin.readline

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    S=input()
    if S[0]==S[2]:
        print("Yes")
    else:
        print("No")

main()

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

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

Solution (Python):
N=list(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):
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    a, b, c = str(sys.stdin.readline().rstrip())
    print("Yes" if a == c else "No")


if __name__ == '__main__':
    main()

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

Solution (Python):
s=input()

a = [c for c in s]
b = [c for c in s[-1::-1]]
answer = "Yes"
for i in range(len(a)):
  if a[i]  != b[i]:
    answer = "No"
    break
print(answer)

Solution (Python):
a = input()
if a[0] == a[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 = 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 = input()

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

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

Solution (Python):
n = input()
if all(n[i] == n[len(n) - i - 1] for i in range(len(n) // 2)):
  print('Yes')
else:
  print('No')

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

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

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

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

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


if __name__ == '__main__':
    main()

Solution (Python):
N = input()

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

Solution (Python):

import sys


s = input().strip()

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

print("Yes")

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

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

N_h_place = N // 100
N_o_place = N % 10

ans = 'No'

if N_h_place == N_o_place:
    ans = 'Yes'

print(ans)

Solution (Python):
N=input()
flag=0
for i in range(int(len(N)/2)):
  if N[i]!=N[len(N)-1-i]:
    flag=1
    break
  
if flag==0:
  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 = input()
M = N[::-1]
if M ==N:
    print("Yes")
else:
    print("No")

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

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

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

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

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

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

Solution (Python):
n=input()
if len(n)%2==0:
    m=int(len(n)/2)
else:
    m=int((len(n)-1)/2)

a=0

for i in range(m):
    if n[i]==n[-1*(i+1)]:
       continue
    else:
        a+=1

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

Solution (Python):
def changehi(n):

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

def main():
    n = str(input())
    print(changehi(n))

if __name__ == '__main__':
    main()

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

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

Solution (Python):
s = input()
if s[0]==s[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('NYoe s'[N[0]==N[2]::2])

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

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

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

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

Solution (Python):
s = input()

if list(s) == list(reversed(list(s))):
  print("Yes")
else:
  print("No")

Solution (Python):

N = input()


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

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

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

Solution (Python):
N = int(input())
s = str(N)
t=""
for i in range(3):
    t = s[i]+t

if t==s:
    print("Yes")
else:
    print("No")

Solution (Python):
n=list(input())
a=True
for i in range(len(n)//2):
    if n[i]!=n[len(n)-1-i]:
        a=False
        break
print('Yes' if a else 'No')

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

Solution (Python):
n = input()

rev_n = list(n)
rev_n.reverse()
rev_n = "".join(rev_n)

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

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

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

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

Solution (Python):
N=list(input())
n=list(reversed(N))
print("Yes" if n==N else "No")

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

Solution (Python):
n = input()

for i in range(3):
    if n[i] != n[3-i-1]:
        print("No")
        exit(0)

print("Yes")

Solution (Python):
str = input().split()
n = str[0]
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[0]==N[2] else "No")

Solution (Python):




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


if __name__ == "__main__":
    main()

Solution (Python):
a=input()
if a[0]==a[-1]:
  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):

import sys
sys.setrecursionlimit(10000000)
INF = 1<<32

YES = "Yes"  
NO = "No"  

def solve(N: int):
    if str(N) == str(N)[::-1]:
        print(YES)
    else:
        print(NO)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    solve(N)

if __name__ == '__main__':
    main()

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

Solution (Python):
"""
author : halo2halo
date : 29, Jan, 2020
"""

import sys
import itertools



read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

x = readline().decode('utf8').rstrip()
print('Yes' if x == x[::-1] else 'No')

Solution (Python):
import math
import calendar
import fractions
import itertools

n = input()

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

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

Solution (Python):
n = input()
ans = "Yes" if list(n) == list(reversed(n)) else "No"
print(ans)

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
s = input()
n = len(s)
for i in range(n):
    if s[i] != s[n - 1 - i]:
        print("No")
        exit()
print("Yes")

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

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

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

Solution (Python):
N = input()
print("YNeos"[N!=N[::-1]::2])

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

Solution (Python):
n = input()
print("Yes" if n==n[::-1] else "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 = int(input())
a = n//100
b = n%10
if a==b:
  print('Yes')
else:
  print('No')

Solution (Python):
def solve(s):

    for i in range(len(s)):
        if s[i] != s[-(i+1)]:
            return False
    return True

if __name__ == '__main__':
    s = input()
    if solve(s):
        print("Yes")
    else:
        print("No")

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

Solution (Python):
n=str(input())
nx=[i for i in n]
nx.reverse()
m="".join(nx)
if n==m:
    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):
import sys
input = sys.stdin.readline
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()

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

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

Solution (Python):
n=input()

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

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

Solution (Python):
N = input()

rN = N[::-1]
if N == rN:
  r = 'Yes'
else:
  r = 'No'
 
print(r)

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

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

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

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

Solution (Python):
num = input()

if(num.endswith(num[0])):
    print('Yes')
else:
    print('No')

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

Solution (Python):


import numpy as np

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

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

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

Solution (Python):
n = input()

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

Solution (Python):
n=input()
print('YNeos'[n[0]!=n[2]::2])

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

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

Solution (Python):
import math
import queue
import bisect
import heapq
import time
import itertools

mod = int(1e9+7)

def swap(a,b):
    return (b,a)

def gcd(a,b): 
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

def lcm(a,b): 
    return a/gcd(a,b)*b

def divisors(a): 
    divisors = []
    for i in range(1,int(a**0.5)+1):
        if a%i==0:
            divisors.append(i)
            if i!=a//i:
                divisors.append(a//i)
    return divisors

def is_prime(a): 
    if a<2:
        return False
    elif a==2:
        return True
    elif a%2==0:
        return False
    sqrt_num = int(a**0.5)
    for i in range(3,sqrt_num+1,2):
        if a%i==0:
            return False
    return True

def prime_num(a): 
    pn = [2]
    for i in range(3,int(a**0.5),2):
        prime = True
        for j in pn:
            if i%j==0:
                prime = False
                break
        if prime:
            pn.append(i)
    return pn

def prime_fact(a): 
    sqrt = math.sqrt(a)
    res = []
    i = 2
    if is_prime(a):
        res.append(a)
    else:
        while a!=1:
            while a%i==0:
                res.append(i)
                a //= i
            i += 1
    return res

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

if __name__=='__main__':
    main()

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

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

Solution (Python):
a, b, c = input()

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

Solution (Python):
n = input()

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

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

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

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

Solution (Python):
n = input()
nn = n[-1::-1]
for i in range(len(n)):
    if n[i] != nn[i]:
        print('No')
        exit()
print('Yes')

Solution (Python):
import sys
input = sys.stdin.readline
N = list(input())
if N[0] == N[2]:
    print("Yes")
else:
    print("No")

Solution (Python):
S = input()

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

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

print("Yes" if n == list(reversed(n)) else "No")

Solution (Python):
n = input()

nr = n[2] + n[1] + n[0]

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

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

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

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

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

Solution (Python):
n=[i for i in input()]
print("Yes" if n==list(reversed(n)) else "No")

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

Solution (Python):
n = input()

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

print('Yes')

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

Solution (Python):
a, b, c = input()

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

Solution (Python):
import sys
from collections import defaultdict, deque
import bisect
from heapq import *
from math import factorial
sys.setrecursionlimit(200000)
input = sys.stdin.readline







S = input().strip()

t = list(S)
t.reverse()

if "".join(t) ==  S:
    print("Yes")
else:
    print("No")

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

Solution (Python):
N = input()
print('YNeos'[N[0]!=N[2]::2])

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

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

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

Solution (Python):
a,b,c =input()

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

Solution (Python):
Q = input()
flag = True
for i in range(len(Q)//2):
    if Q[i] != Q[-i-1]:
        flag = False
if flag:
    print('Yes')
else:
    print('No')

Solution (Python):
Q = list(input())
Qr = [Q[-i-1] for i in range(len(Q))]
if Q == Qr:
    print('Yes')
else:
    print('No')

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

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