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()
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,b,c=input()
print("Yes" if a==c else "No")

Solution (Python):
import sys

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

def main():
    return 'Yes' if s[::-1] == s else 'No'

if __name__ == '__main__':
    ans = main()
    print(ans)

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

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

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

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

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

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

Solution (Python):
import math

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

Solution (Python):
import math

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

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

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

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

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

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

Solution (Python):
N = input()

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

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

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

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

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

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

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

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

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

Solution (Python):
P, _, Q = input()
print('Yes' if P==Q else 'No')

Solution (Python):
n = input()

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

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

Solution (Python):
a,b,c=input()
print("Yes" if a==c else "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):
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 list(reversed(n)) == n:
    print('Yes')
else:
    print('No')

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

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

Solution (Python):
N=input()
r=N[::-1]
if N==r:
    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 == "".join(N[::-1]):
  	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()
print("Yes" if a+b+c==c+b+a else "No")

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

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

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

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

Solution (Python):
a, b, c=map(int, input())
if a == c:
  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):
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):
a,b,c = input()
print("Yes" if a==c else "No")

Solution (Python):
N = input()

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

print(ans)

Solution (Python):
S = input()

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

Solution (Python):

import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

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

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

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

Solution (Python):
def main():
    i = list(map(int, input().split()))
    n = i[0]

    if n < 100 or 999 < n or isinstance(n, int) == False:
        return

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

if __name__ == "__main__":
    main()

Solution (Python):


N=list(input())

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

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

Solution (Python):
N = [c for c in 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 = list(input())
ans = "Yes"
for i in range(3):
  if n[i] != n[-i -1]:
    ans = "No"
print(ans)

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

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

Solution (Python):
n = str(input())
rn = ''.join(reversed(list(n)))
print('Yes' if n == rn else 'No')

Solution (Python):
n = str(input())
rn = ''.join(list(reversed(list(n))))
print('Yes' if n == rn else 'No')

Solution (Python):
from sys import stdin
from itertools import groupby

s = stdin.readline().rstrip()

si = s[::-1]

if si == s:
    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[::-1]==n else "No")

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

Solution (Python):

import math



N = str(input())

N2 = ""

for i in range(len(N)) :
  N2 += N[len(N) - 1 - i]

if N == N2 :
  print ("Yes")
else :
  print ("No")

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

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

Solution (Python):
a,b,c=input()
print("YNeos"[a!=c::2])

Solution (Python):
a, b, c=input()
print("YNeos"[a!=c::2])

Solution (Python):
a, b, c = input()
print("YNeos"[a!=c::2])

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

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

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

import sys
import copy
import bisect
import heapq
from collections import Counter,defaultdict,deque
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))
def LS(): return sys.stdin.readline().split()
def S(): return sys.stdin.readline().strip()
mod = 10**9 + 7
inf = float('inf')

examA()

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

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

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

Solution (Python):
N = input()
print('Yes' if N == ''.join([n for n in N[::-1]]) else 'No')

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

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

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

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

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

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

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

a = str(n)

b = a[2] + a[1] + a[0]

b = int(b)

if n == b:
	ans = 'Yes'
else:
	ans = 'No'
	
print(ans)

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

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

Solution (Python):

N = str(input())

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

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

Solution (Python):

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

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

Solution (Python):
from sys import stdin

n = stdin.readline().rstrip()
print('Yes' if n == ''.join(reversed(n)) else 'No')

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

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

Solution (Python):

N = input()
M = N[2]+N[1]+N[0]
if(int(N) == int(M)):
  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 = 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):
a,b,c=input()
print("Yes" if a==c else "No")

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

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

Solution (Python):
def palindromic_number():
    n = input()
    n_reversed = ''.join(list(reversed(n)))
    if n == n_reversed:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    palindromic_number()

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

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

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):
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):
a,b,c = input()
print("Yes" if a==c else "No")

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

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

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

if (int(N / 100)) == (N % 10):
    print("Yes")
elif (int(N / 100)) != (N % 10):
    print("No")

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

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

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

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

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

Solution (Python):
a, b, c = input()
if a == c:
  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):
def main():
    n=input()
    for i,j in zip(n,reversed(n)):
        if i!=j:
            print('No')
            exit()
    print('Yes')

if __name__ == '__main__':
    main()

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):
a,b,c=input()
print("Yes" if a==c else "No")

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

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

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

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

Solution (Python):
s=input()
if s[0]==s[-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 "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=str(input());print('YNeos'[N[0]!=N[2]::2])

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

Solution (Python):
N = input()

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

Solution (Python):
n=input();i=(n==n[::-1])^1;print("YNeos"[i::2])

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

Solution (Python):
def slove():
    import sys
    input = sys.stdin.readline
    n = str(input().rstrip('\n'))
    for i in range(len(n)):
        if n[i] != n[-i-1]:
            print("No")
            exit()
    print("Yes")


if __name__ == '__main__':
    slove()

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

Solution (Python):
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

Solution (Python):


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

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

Solution (Python):
INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
    N=STR()
    if N[0]==N[2]:
        print('Yes')
    else:
        print('No')
if __name__ == '__main__':
    do()

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

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

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

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

Solution (Python):
N = input()
NN = list(N)
checker = ""
for i in range(len(NN)):
    checker += NN[-i-1]
if N == checker:
    print("Yes")
else:
    print("No")

Solution (Python):
import sys
import math
from fractions import gcd





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

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

big_prime = 1000000007

"""


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


 = int(sys.stdin.readline())
 = map(int, sys.stdin.readline().split())
 = list(map(int, sys.stdin.readline().split()))
 = [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""


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

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

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

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

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

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

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

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

reverse_Nlist = []
for n in reversed(str(N)):
    reverse_Nlist.append(n)

normal_Nlist = []
for n in str(N):
    normal_Nlist.append(n)

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


if __name__ == "__main__":
    resolve()

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

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

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

if a[0] == a[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","No"][a!=c])

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

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[0]==n[2] else 'No')

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

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

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

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

Solution (Python):






def main():
	n = int(input())
	c1 = n % 10
	c2 = n // 10 % 10
	c3 = n // 100
	if c1 == c3:
		print("Yes")
	else:
		print("No")





if __name__ == "__main__":
	main()

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

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

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

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

N_rvsd = list(reversed(N))

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

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

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

N = list(n)
X = N[::-1]


if X == 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('YNeos'[n!=n[::-1]::2])

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

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

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



if __name__ == "__main__":
    main()

Solution (Python):
n_str = input()
n_list = list(n_str)
n_list_reverse = list(n_str)
n_list_reverse.reverse()
if n_list == n_list_reverse:
    print("Yes")
else:
    print("No")

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

Solution (Python):
s = input()

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

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

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

Solution (Python):
import sys

if sys.platform =='ios':
    sys.stdin=open('input_file.txt')
    
N=input()

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

Solution (Python):

N = str(input())

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

Solution (Python):
a = input()
print("Yes") if a == a[::-1] 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):
N = input()
j = len(N) - 1
flag = True
for i in range(len(N)):
    if N[i] != N[j]:
        print('No')
        flag = False
        break
    j -= 1
if flag:
    print('Yes')

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

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

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

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

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

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

Solution (Python):
import sys
import copy
import  math
import bisect
from collections import *
from operator import itemgetter
"""
from fractions import gcd
def lcm(x, y):
    return (x * y) // gcd(x, y)
"""
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline()

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

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

Solution (Python):
n = input()
n_l = list(n)
reversed_l = []
for i in n_l[::-1]:
    reversed_l.append(i)
reversed_l = ''.join(reversed_l)
if n == reversed_l:
    print('Yes')
else:
    print('No')

Solution (Python):
n = input()

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

Solution (Python):
a = int(input())
if 100 <= a <= 999:
    n = str(a)
    nlist = list(n)
    print('Yes' if nlist[0] == nlist[2] else 'No')
else:
    print('hoge!')

Solution (Python):
a = int(input())
if 100 <= a <= 999:
    n = str(a)
    nlist = list(n)
    rev = []
    for i in range(len(nlist)):
        rev.append(nlist[2 - i])
    print('Yes' if nlist == rev else 'No')
else:
    print('hoge!')

Solution (Python):


import sys
import math
import bisect
import time
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

n = input()
if n == n[::-1]:
    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):
print("Yes"if str(int(input())%101/10)[1:]==".0"else"No")

Solution (Python):
print("Yes" if str(int(input()) % 101 / 10)[1:] == ".0" else "No")

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

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

half = len(N) // 2

if len(N)%2 == 0:
  left_N = N[:half]
  right_N = N[half:]
else:
  left_N = N[:half]
  right_N = N[half+1:]

for l,r in zip(left_N, right_N[::-1]):
  if l != r:
    print('No')
    exit()
    
print('Yes')

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

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

Solution (Python):
a,b,c=input();print('YNeos'[a!=c::2])

Solution (Python):
a,b,c=input();print('YNeos'[a!=c::2])

Solution (Python):
n = list(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):
def main():
    N = input()
    if N[0] == N[-1]:
        return "Yes"
    return "No"


if __name__ == '__main__':
    print(main())

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

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

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