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-----
575

-----Sample Output-----
Yes

N=575 is also 575 when read backward, so it is a palindromic number. You should print Yes.

Difficulty: EASY

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


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


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


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


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


print(('Yes', 'No')[len(set(input()[::2])) - 1])


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


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


S = input()
N = len(S)
for i in range(N // 2):
	if S[i] != S[-i - 1]:
		print('No')
		break
else:
	print('Yes')


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


s = input()
print('YNeos'[s[0] != s[2]::2])


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


a = input()
b = ''.join(list(reversed(a)))
print('Yes' if a == b else 'No')


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


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


N = str(input())
ans = 'Yes'
for i in range(len(N) // 2):
	if N[i] != N[len(N) - i - 1]:
		ans = 'No'
		break
print(ans)


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


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


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


a = input()
print('YNeos'[a[0] != a[2]::2])


s = input()
print('NYoe s'[s == s[::-1]::2])


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


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


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


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


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


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


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


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


a = input()
b = ''
for i in range(len(a)):
	b += a[len(a) - i - 1]
if a == b:
	print('Yes')
else:
	print('No')


S = input()
print('YNeos'[S[0] != S[2]::2])


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


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


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


K = list(input())
print('Yes' if K[0] == K[2] else 'No')


N = input()
S = N[::-1]
ans = 0
for i in range(len(N)):
	if N[i] == S[i]:
		ans += 1
if ans == len(N):
	print('Yes')
else:
	print('No')


print('YNeos'[len(set(input()[0::2])) != 1::2])


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


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


LI = lambda : list(map(int, input().split()))
N = input()

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

def __starting_point():
	main()
__starting_point()


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


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


url = 'https://atcoder.jp//contests/abc070/tasks/abc070_a'

def main():
	x = input()
	if x == ''.join(reversed(x)):
		print('Yes')
	else:
		print('No')

def __starting_point():
	main()
__starting_point()


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


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


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


n = input()
t = list(n)
s = list(reversed(n))
if s == t:
	print('Yes')
else:
	print('No')


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


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


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


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