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:
N = input().strip()
a = int(N)
b = int(N[::-1])
if a == b:
    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:
s = input()
print ("Yes") if s[0] == s[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:
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:
s = input()
s_r = "".join(list(reversed(s)))
if s == s_r:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
if N // 100 == N % 10:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline


def main():
    N = int(input())

    num = str(N)
    if num[0] == num[-1]:
        ans = "Yes"
    else:
        ans = "No"

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=input();print('NYoe s'[n[0]==n[2]::2])

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

Submission status: Accepted

Solution code:
n = input()

#3桁なのでとても簡単

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

Submission status: Accepted

Solution code:
n = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
## io ##
def IS(): return sys.stdin.readline().rstrip()
def II(): return int(IS())
def MII(): return list(map(int, IS().split()))
def MIIZ(): return list(map(lambda x: x-1, MII()))
#======================================================#
def main():
    n = IS()
    if n[0] == n[2]: print('Yes')
    else: print('No')

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = input()
N_reverse = N[::-1]

if N == N_reverse:
  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:
# coding = SJIS
n = str(input())
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=input()

if N[0]==N[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:
n = int(input())
i = str(n)
m = n // 100
if str(m) == i[-1]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
N = input()
re_N = N[::-1]

if N == re_N:
    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:
number_str = input()
number_int = int(number_str)

n_100 = number_int // 100
n_10 = number_int // 10 *10
n_1 = number_int - n_10

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())
m = n //100
l = n %10

if m==l:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict, deque
import sys


def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

n = readline().decode()
ans = 'Yes' if int(n[0::]) == int(n[::-1]) else 'No'
print(ans)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs            # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random                                # random, uniform, randint, randrange, shuffle, sample
# import string                                # ascii_lowercase, ascii_uppercase, ascii_letters, digits, hexdigits
# import re                                    # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from bisect import bisect_left, bisect_right # bisect_left(a, x, lo=0, hi=len(a)) returns i such that all(val<x for val in a[lo:i]) and all(val>-=x for val in a[i:hi]).
# from collections import deque                # deque class. deque(L): dq.append(x), dq.appendleft(x), dq.pop(), dq.popleft(), dq.rotate()
# from collections import defaultdict          # subclass of dict. defaultdict(facroty)
# from collections import Counter              # subclass of dict. Counter(iter): c.elements(), c.most_common(n), c.subtract(iter)
# from datetime import date, datetime          # date.today(), date(year,month,day) => date obj; datetime.now(), datetime(year,month,day,hour,second,microsecond) => datetime obj; subtraction => timedelta obj
# from datetime.datetime import strptime       # strptime('2019/01/01 10:05:20', '%Y/%m/%d/ %H:%M:%S') returns datetime obj
# from datetime import timedelta               # td.days, td.seconds, td.microseconds, td.total_seconds(). abs function is also available.
# from copy import copy, deepcopy              # use deepcopy to copy multi-dimentional matrix without reference
# from functools import reduce                 # reduce(f, iter[, init])
# from functools import lru_cache              # @lrucache ...arguments of functions should be able to be keys of dict (e.g. list is not allowed)
# from heapq import heapify, heappush, heappop # built-in list. heapify(L) changes list in-place to min-heap in O(n), heappush(heapL, x) and heappop(heapL) in O(lgn).
# from heapq import nlargest, nsmallest        # nlargest(n, iter[, key]) returns k-largest-list in O(n+klgn).
# from itertools import count, cycle, repeat   # count(start[,step]), cycle(iter), repeat(elm[,n])
# from itertools import groupby                # [(k, list(g)) for k, g in groupby('000112')] returns [('0',['0','0','0']), ('1',['1','1']), ('2',['2'])]
# from itertools import starmap                # starmap(pow, [[2,5], [3,2]]) returns [32, 9]
# from itertools import product, permutations  # product(iter, repeat=n), permutations(iter[,r])
# from itertools import combinations, combinations_with_replacement
# from itertools import accumulate             # accumulate(iter[, f])
# from operator import itemgetter              # itemgetter(1), itemgetter('key')
# from fractions import gcd                    # for Python 3.4 (previous contest @AtCoder)



def main():
    mod = 1000000007                # 10^9+7
    inf = float('inf')              # sys.float_info.max = 1.79...e+308
    # inf = 2 ** 64 - 1             # (for fast JIT compile in PyPy) 1.84...e+19
    sys.setrecursionlimit(10**6)    # 1000 -> 1000000
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    n = input()
    print('Yes') if n[0] == n[-1] else print('No')


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = list(input())
y = list(reversed(x))
if x == y:
    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:

N = input()
'''
str=''
str_list=list(N)
str_list2= list(reversed(N))
if str.join(str_list)==str.join(str_list2):
    print('Yes')
else:
    print('No')
'''
#スライス操作　逆のステップ指定
if N ==N[::-1]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
N = input()
str=''
str_list=list(N)
str_list2= list(reversed(N))
if str.join(str_list)==str.join(str_list2):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
# -*- coding: <encoding name> -*-

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

Submission status: Accepted

Solution code:
n = input()

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


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


if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print("YNeos"[len(set(input()[0::2])) != 1::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu May 14 11:58:24 2020

@author: shinba
"""

n = input()

s = n[::-1]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
N = list(input())
print(['No', 'Yes'][N[0] == N[2]])

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 == 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:
import sys
import math
import bisect

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

if __name__ == "__main__":
    main()

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

Submission status: Accepted

Solution code:
def main():
    n = list(input())
    if n[0] == n[-1]:
        ans = 'Yes'
    else:
        ans = 'No'
    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input() #strで受け取る

#print(N[0],N[2])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':

    ABC_70_A()

Submission status: Accepted

Solution code:
# region header
import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
# endregion
N = rs()
print('Yes' if N == N[::-1] else 'No')

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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[-1] else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7
 
N = input()
print("Yes" if N == N[::-1] else "No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

N = input()

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline().rstrip
n = input()
print('Yes' if n == n[::-1] else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

n = input()
t = ""
for i in range(len(n)-1,-1,-1):
    t+=n[i]
if t == n:
    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=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=list(input())
for i in range(len(N)//2+1):
  #print(N[i],N[len(N)-i-1])
  if N[i]!=N[len(N)-i-1]:
    print("No")
    break
else:
  print("Yes")

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 == "".join(reversed(list(n))):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n = input()
rn = n[::-1]
if n == rn:
  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:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
n_ = n[::-1]
if n == n_:
  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()
if s == 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:
s = input()
rs = ''.join(list(reversed(s)))
print("Yes") if s == rs else print("No")

Submission status: Accepted

Solution code:
N = input()
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:
# ABC070A

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

Submission status: Accepted

Solution code:
S = str(input())
l = int(len(S))

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

Submission status: Accepted

Solution code:

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


if '__main__' == __name__:
    resolve()

Submission status: Accepted

Solution code:
"""MILOY"""
x=input()
p=len(x)
n=int(x)
s=0
c=int(x)
for i in range(p):
    
    rem=n%10
    n=n/10
    s=(s*10)+int(rem)
    n=int(n)
    
    
   
   
if (c==s):
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
x=input()
p=len(x)
n=int(x)
s=0
c=int(x)
for i in range(p):
    
    rem=n%10
    n=n/10
    s=(s*10)+int(rem)
    n=int(n)
    
    
   
   
if (c==s):
    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:
def resolve():
    n=input()
    if n[0]==n[2]:
        print('Yes')
    else:
        print('No')
resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

def main():
    N=input()
    YesNo(N==N[::-1])

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
if s=="".join(reversed(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[0] == 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 = int(input())

a = 0
b = 0

for i in range(1,10):
    if N > 100:
        N = N - 100
        a = a + 1

for j in range(1,10):
    if N > 10:
        N = N - 10
        b = b + 1
c = N

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=int(input())

a=N//100

b=N-a

if (N-a)%10==0:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = int(input())
lst = []
lst2 = []
while num > 0:
    lst.append(num%10)
    lst2.append(num%10)
    num //= 10
lst2.reverse()
if lst == lst2:
  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:
S=str(input())
if S[0] == S[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:
N = 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:
n = int(input())
if n // 100 == n % 10:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

Solution code:
a,b,c=map(int, list(input()))
print('Yes' if a == c else '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=input()
n=int(n)
og=n
rev=0
while(n>0):
    d=n%10  
    n=n//10
    rev=rev*10+d
if(rev==og):
    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:
a = input()

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