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

Solution (Python):
import sys


def input():
    return sys.stdin.readline()[:-1]








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

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

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

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

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

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

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

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

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

Solution (Python):
N = input()

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

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

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

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

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

Solution (Python):


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

    return n

def submit():
    n = read_input()

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


if __name__ == '__main__':
    submit()

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

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

h=n // 100

t=(n-h*100) // 10

o=(n-h*100-t*10)

if h==o:
  print("Yes")
else:
  print("No")

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

Solution (Python):
s = input()

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

Solution (Python):
s  = input()

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

Solution (Python):
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    s = input()


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

solve()

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

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

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

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=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 = list(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 = list(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):
from functools import reduce
import math

def main():
    
    
    
    

    
    
    
    
    
    

    
    

    
    
    
    
    
    
    
    
    
    INF = float("inf")

    
    MOD = 10**9+7
    
    
    
    a = input().rstrip()
    
    
    
    
    
    
    
    
    
    
    

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

Solution (Python):


n = input()

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

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

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

Solution (Python):
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


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


def inlf():
    return list(map(float, input().split()))


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


def inpm(line):
    return [inp() for _ in range(line)]


def inpfm(line):
    return [inpf() for _ in range(line)]


def inpsm(line):
    return [inps() for _ in range(line)]


def inlm(line):
    return [inl() for _ in range(line)]


def inlfm(line):
    return [inlf() for _ in range(line)]


def inlsm(line):
    return [inls() for _ in range(line)]


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper


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

Solution (Python):

import copy
import random
import bisect 
import math

N = str(input())


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

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

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

if N==Nr:
    ans = 'Yes'
else:
    ans = 'No'

print(ans)

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

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

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

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

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

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

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

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

Solution (Python):
s=input()
print('NYoe s'[s[0]==s[2]::2])

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

Solution (Python):
N=input()

if N[0]==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):
print("YNeos"[len(set(input()[0:3:2]))-1::2])

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

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

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

Solution (Python):
n = str(input())
if n == n[len(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 print('No')

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

Solution (Python):
num=input()

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

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

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

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

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

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

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

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

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

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()
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):
a=[]
a=list(map(int,input()))
if a[0]==a[2]:
    print('Yes')
else:
    print('No')

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

Solution (Python):


n = int(input())

def digit_list(num):
    num = str(num)
    num = list(num)
    num = list(map(int,num))
    return num

n = digit_list(n)

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

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

Solution (Python):
import sys

def main():
    input = sys.stdin.readline
    N = int(input())
    a = N // 100
    b = N % 10

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


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

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

Solution (Python):
N = input()

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

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

Solution (Python):

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

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

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

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

Solution (Python):
import math
import functools
import itertools
import numpy as np
import sys
MAX_INT = int(10e10)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

N = S()

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

Solution (Python):
n=input()
if n[::-1]==n: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):
def palindromic_number(N: int) -> bool:
    n1, n100 = N % 10, N//100
    return n1 == n100


if __name__ == "__main__":
    N = int(input())
    yes = palindromic_number(N)
    print('Yes' if yes else 'No')

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

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

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

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

Solution (Python):


n = input()

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

Solution (Python):
import math
def p(d): print(d)
def i(): return input()

def LI():  
    
    return int(input())
def LIS():  
    
    return [int(x) for x in input().split()]
def MLIS(n):  
    
    return [[int(x) for x in input().split()] for y in range(n)]
def LC():  
    
    return input()
def LCS(): 
    
    return [x for x in input().split()]
def MLCS(n): 
    
    return [[x for x in input().split()] for y in range(n)]

def alp2int(alphabet):
    
    return ord(alphabet) - ord('a')
def int2alp(num):
    
    return chr(num + ord('a'))
def cnt2dic(lst, dic={}):
    
    for x in lst:
        key = str(x)
        if key in dic:
            dic[key] += 1
        else:
            dic[key] = 1
    return dic
def dic2lst(dic, key=lambda x:x[1]):
    
    return sorted(list(dic.items()), key=key);

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

def B():
    pass

def C():
    pass

def D():
    pass

def E():
    pass

def F():
    pass

def G():
    pass

def H():
    pass

A()

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007


def A():
    n = S()
    n1 = n[::-1]
    for i in range(len(n)):
        if n1[i] != n[i]:
            print("No")
            return
    print("Yes")
    return


def B():
    return


def C():
    return


def D():
    return


def E():
    return


def F():
    return


def G():
    return


def H():
    return


if __name__ == '__main__':
    A()

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007


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



"""
def gcd(a,b):
    if a == 0:
        return b
    return gcd(b%a,a)
n = I()
a = IR(n)
l = a[0]
for i in range(1,n):
    g = gcd(l,a[i])
    l *= a[i]//g
print(l)
"""


"""
n = I()
v = [[] for i in range(n)]
for i in range(n-1):
    a,b,c = LI()
    a -= 1
    b -= 1
    v[a].append([b,c])
    v[b].append([a,c])
Q,k = LI()
d = [-1 for i in range(n)]
d[k-1] = 0
q = deque()
q.append(k-1)
while q:
    x = q.pop()
    for y,c in v[x]:
        if d[y] == -1:
            d[y] = d[x]+c
            q.append(y)
for i in range(Q):
    x,y = LI()
    x -= 1
    y -= 1
    print(d[x]+d[y])
"""

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

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

Solution (Python):

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

Solution (Python):

import sys

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


if __name__ == '__main__':
    main()

Solution (Python):



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


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 = [i for i in input()]
check = True
if N[0] == N[-1]:
    print("Yes")
else:
    print("No")

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

Solution (Python):
a=input()
ans=0
for i in range(len(a)):
  if not a[i]==a[len(a)-1-i]:
    ans=1
if ans==1:
  print("No")
else:
  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()
print("Yes" if n[0]==n[2] else "No")

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

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

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

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

Solution (Python):
s = list(str(input()))
t = s[::-1]

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

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

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

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

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


if __name__ == "__main__":
    main()

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

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

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

Solution (Python):
N = input()

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

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

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

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

Solution (Python):

import sys

def main():
	num = input()
	val = list(num)
	
	if val[0] == val[2]:
		print("Yes")
	else:
		print("No")
	
if __name__ == "__main__":
	main()

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

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

Solution (Python):
from sys import stdin
l = list(stdin.readline().rstrip())
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):
n = input()
N0 = list(n)
N1 = list(n)
N1.reverse()

if(N0 == N1):
  print('Yes')
else:
  print('No')

Solution (Python):

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):


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

Solution (Python):
s = input()

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

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

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

ans = N // 100 == N % 10

print("Yes" if ans else "No")
print()

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

Solution (Python):
N = input()

trueNum = 0
for i in range(len(N)):
    if N[i] == N[len(N) - 1 - i]:
        trueNum += 1

if trueNum == len(N):
    print("Yes")
else:
    print("No")

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

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

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

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

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

Solution (Python):
a=int(input())
x=a%10
a=(a-x)/10
b=a%10
a=(a-b)/10
y=a%10
if x==y:
  print("Yes")
else:
  print("No")

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

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

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

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

Solution (Python):
n = input()

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

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

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

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

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

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

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

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

Solution (Python):

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

Solution (Python):

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

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

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

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

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

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

Solution (Python):
def main() :
    N = input()
    for i in range(len(N)) :
        if (N[i] != N[-1 * i - 1]) :
            print("No")
            return
    
    print("Yes")

main()

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 = list(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):
def main():
  x = input()
  if x == x[2]+x[1]+x[0]:
    print('Yes')
    return
  print('No')
  return
if __name__ == '__main__':
  main()

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

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()
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):
n=input()
flag=True
for i in range(len(n)):
    if n[i]!=n[len(n)-1-i]:
        flag=False
        break
if flag:
    print("Yes")
else:
    print("No")

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

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

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


abc070_a()

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

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

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

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