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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = list(input())


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


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:
num_str = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC070
#文字列の逆順
n = input()
print("Yes" if n==n[::-1] else "No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

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


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:
#
# abc070 a
#
import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """575"""
        output = """Yes"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """123"""
        output = """No"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """812"""
        output = """No"""
        self.assertIO(input, output)


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


if __name__ == "__main__":
    # unittest.main()
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    s = input()

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


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()
print("Yes" if n[0]==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:
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:
print("YNeos"[(s:=input())!=s[::-1]::2])

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

Submission status: Accepted

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

N = input()


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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


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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
L=list(input())
if L[0]==L[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()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())
if s[0] == s[-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:
s=input();print('NYoe s'[s==s[::-1]::2])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

n = list(n)
t = list(n)
n.reverse()

if n == t:
  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 = (input())
#a, b = map(int,input().split())
#l = list(map(int,input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
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 = list(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:
def is_palindrome(s: str) -> bool:
    return s == s[::-1]

N = input()
print('Yes' if is_palindrome(N) else 'No')

Submission status: Accepted

Solution code:
def is_palindrome(s: str) -> bool:
    return s[:len(s) // 2] == s[-1 * (len(s) // 2):][::-1]

N = input()
print('Yes' if is_palindrome(N) 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 = list(input())
if a == c:
  print("Yes")
else:
  print("No")

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(input())
def F(): return float(input())
def SS(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LSS(): return input().split()

def resolve():
    N = SS()

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

if __name__ == '__main__':
    resolve()

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.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=input()
ok=True
for i,c in enumerate(N):
  if c!=N[len(N)-i-1]:
    ok=False
if ok:
  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:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))
#l = [list(map(int,input().split())) for i in range(n)]
#a = [list(input()) for _ in range(n)]
#a = [int(input()) for _ in range(n)]

s = input()

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

Submission status: Accepted

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


if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()


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

Submission status: Accepted

Solution code:
# # Make IO faster
# import sys
# input = sys.stdin.readline

# # get single (or) multiple str
# X = input()

# # get single int
# N = int(input())
# # get multiple int (e.g., 2)
# X, Y = map(int, input().split())
# # get multiple int (e.g., 2) for N lines
# XY = [list(map(int, input().split())) for _ in range(N)]

# from IPython import embed; embed(); exit();

# 全部入り
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
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
import numpy as np
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

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:
tmp = list(input())
print("Yes") if tmp[0] == tmp[2] 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:
x=input()
if x==x[::-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=int(input())
if n%10==(n-n%100)//100:
  print('Yes')
else:
  print('No')

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N=input()

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

Submission status: Accepted

Solution code:
import math
n = input()
before = n[:int(len(n)/2)]
after = n[math.ceil(len(n)/2):]
after = after[::-1]

if after == before:
    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 = list(str(input()))
n_r = [ i for i in reversed(n)]
if n == n_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 = list(input())
if list(reversed(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:
n = input()
if n[0] == n[2]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str_N = input()

if (str_N[0] == str_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[2]+n[1]+n[0]==n else "No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import sys
#import numpy as np
import math
#from fractions import Fraction
import itertools
from collections import deque
from collections import Counter
#import heapq
from fractions  import gcd
#input=sys.stdin.readline
import bisect
n=int(input())
i=n//100
j=n%10
if i == j:
    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:
import sys
def LI2(): return list(map(int,sys.stdin.readline().rstrip()))  #空白なし

N = LI2()
print('Yes' if N[0] == 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,*b,c=input();print('Yes' if a==c else 'No')

Submission status: Accepted

Solution code:
s = input()
if s[-1]==s[0]:
    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:
# その13
# A - Palindromic Number

N = str(input())

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

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
N = S()
if N[0] == N[2]:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
n1, n2, n3 = list(input())
if n1 == n3:
    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 = int(input())
N_str = str(N)

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

Submission status: Accepted

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

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:
#!/usr/bin/env python3
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections
from decimal import Decimal # 10進数で考慮できる

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))



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= int(input())
a=N % 10
c =int(N/100)
if c==a:
  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:
a, b, c = input()
print("Yes" if a==c else "No")

Submission status: Accepted

Solution code:
n = input()
N = len(n)
x=[]
y=[]
for i in range(N):
  x.append(n[i])
for j in reversed(range(N)):
  y.append(n[j])

if x==y:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

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 ()
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:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

N = s()
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 = input()

print("Yes" if N == "".join(reversed(list(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:
s=input()
if s[0]==s[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 = int(input())

a = N // 100
b = N % 10

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

Submission status: Accepted

Solution code:
n = list(input())
print("Yes" if n[:2]==n[1:][::-1] 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 = input().strip()
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[-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:
array = list(map(str, input()))
if array[0] == array[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 == n[::-1]:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
d = input()

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

Submission status: Accepted

Solution code:
n = int(input())
n_i = str(n)
if n % 2 == 0:
    print('No')

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
INF = 10**9
mod = 10**9+7

N = list(s())
if ''.join(reversed(N)) == ''.join(N):
    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 = map(int, input().split())
s = input()
print("Yes" if s==s[::-1] 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:
def resolve():
    n = input()
    check = ""
    true_check = ""
    for i in range(len(n)):
        true_check += "T"
        if n[i] == n[len(n)-i-1]:
            check += "T"
        else:
            check += "F"
            print("No")
            break
    if not("F" in check) and check == true_check:
        print("Yes")
resolve()

Submission status: Accepted

Solution code:
s=input()
if s[0]==s[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:
a,_,c=input()
print('YNeos'[a!=c::2])

Submission status: Accepted

Solution code:
s=input()
t=s[::-1]
if s==t:
  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:
import sys
N = int(input())
if N < 100 or N > 1000:
    sys.exit()
strN = str(N)
if N == int(strN[::-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]:
	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:
N = input()

str1 = N[0]
str2 = N[1]
str3 = N[2]

str = str3 + str2 + str1

if (N == str):
    print("Yes")

else:
    print("No")

Submission status: Accepted

Solution code:
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

def main():
    N = input()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

n = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def actual(N):
    s = str(N)

    if s == s[::-1]:
        return 'Yes'

    return 'No'

N = int(input())
print(actual(N))

Submission status: Accepted

Solution code:
s = input()
if s == s[::-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()
print("Yes" if N[0]==N[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=input();print("YNeos"[n[::-1]!=n::2])

Submission status: Accepted

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