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



Sample input:
575


Sample output:
Yes

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
n = list(input())

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

Submission status: Accepted

Solution code:
n = input()

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

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

print('Yes')

Submission status: Accepted

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

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

Submission status: Accepted

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

# N, = map(int, input().split())
# N = int(input())
# L = [int(v) for v in input().split()]
# L = [[int(v) for v in input().split()] for _ in range(N)]
# L = [int(input()) for _ in range(N)]
# L = [list(input().strip())  for _ in range(N)]
S = input().strip()

t = list(S)
t.reverse()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

Solution code:
import math

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

Solution code:
N = list(str(int(input())))
if N == list(reversed(N)) :
  print("Yes")
else :
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = list(input())

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

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

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

print(ans)

Submission status: Accepted

Solution code:
S = input()

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

Submission status: Accepted

Solution code:
# ABC070a
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

Solution code:
##### 解けた #####

N=list(input())

if N==list(reversed(N)): # もし回文数なら
    print("Yes")
else: # 回文数でないなら
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = [c for c in input()]
if N[0] == N[2]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
from itertools import groupby

s = stdin.readline().rstrip()

si = s[::-1]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math

#入力
#n, m = map(int, input().split())
N = str(input())

N2 = ""

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#70a
N = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#Palindromic Number
N = input()
if N[0:1] == N[2:3]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

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

# need to have reversed object convert into a str by using join method.

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Palindromic Number
n = input()
print('Yes' if n == n[::-1] else 'No')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N = input()
M = N[2]+N[1]+N[0]
if(int(N) == int(M)):
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    n=input()
    for i,j in zip(n,reversed(n)):
        if i!=j:
            print('No')
            exit()
    print('Yes')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=str(input());print('YNeos'[N[0]!=N[2]::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:
N=input()

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

Submission status: Accepted

Solution code:
i1,i2,i3=input()
print('Yes' if i1==i3 else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

n = list(str(input()))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

Solution code:
# A - Palindromic Number
N = str(input())
if N[0] == N[2]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
from fractions import gcd
# import queue
# from collections import Counter
# from itertools import accumulate
# from functools import reduce

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")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8

n = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c = input()
print(["Yes","No"][a!=c])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:






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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = list(input())

N_rvsd = list(reversed(N))

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

Submission status: Accepted

Solution code:
n = str(input())

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


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
s_=s[2]+s[1]+s[0]
if s==s_:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
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()

Submission status: Accepted

Solution code:
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")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-S
N = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = list(input())

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

Submission status: Accepted

Solution code:
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')

Submission status: Accepted

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

Submission status: Accepted

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