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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    number = input()
    r_number = number[::-1]

    if int(number) == int(r_number):
        print("Yes")
    else:
        print("No")
main()

Submission status: Accepted

Solution code:
n=input()
s=""
for i in reversed(n):
    s+=i

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

Submission status: Accepted

Solution code:
N = input()

M=len(N)//2

flag=1
for i in range(M):
  if N[i]!=N[len(N)-1-i]:
    flag=0
    break
print('Yes' if flag==1 else 'No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if __name__ == '__main__':
    main()

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())
a = n//100
b = (n - a*100)//10
c = n - a*100 - b*10
if a == c:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
x = int(input())

a = (x//100)
b = x - 100 * a
c = b//10
d = b - 10 * c

if a == d:
  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 ''.join(list(reversed(N))) == N else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()
reversed_N = "".join([str(x) for x in N[::-1]])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy

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

Submission status: Accepted

Solution code:
N = input()

R = ''.join(list(reversed(list(N))))

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import os

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    N = iss()
    print('Yes' if N == N[::-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 = int(input())
print("Yes" if n//100 == n%10 else "No")

Submission status: Accepted

Solution code:
n = input().strip()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
N = input()
if N[0] == N[2]:
    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:
# https://atcoder.jp/contests/abc070/tasks/abc070_a

N = input()

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

Submission status: Accepted

Solution code:
import itertools
def main():
  n = input()
  print("Yes" if n == n[::-1] else "No")
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:
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:
import sys

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

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

if __name__ ==  '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

if __name__ == '__main__':
    s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()
l = N[2]+N[1]+N[0]
if N == l:
    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())
ans = 'No'
if str(N)==str(N)[::-1]:
  ans ='Yes'
print(ans)

#print(*ans, sep='\n')

Submission status: Accepted

Solution code:
import math



a=input()

print("Yes" if a[0]==a[2]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 = input()

rev_N = N[2] + N[1] + N[0]

if int(N) == int(rev_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==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:
# Author: cr4zjh0bp
# Created: Sun Mar 22 22:02:37 UTC 2020
import sys
 
stdin = sys.stdin
inf = 1 << 60
mod = 1000000007
 
ni      = lambda: int(ns())
nin     = lambda y: [ni() for _ in range(y)]
na      = lambda: list(map(int, stdin.readline().split()))
nan     = lambda y: [na() for _ in range(y)]
nf      = lambda: float(ns())
nfn     = lambda y: [nf() for _ in range(y)]
nfa     = lambda: list(map(float, stdin.readline().split()))
nfan    = lambda y: [nfa() for _ in range(y)]
ns      = lambda: stdin.readline().rstrip()
nsn     = lambda y: [ns() for _ in range(y)]
ncl     = lambda y: [list(ns()) for _ in range(y)]
nas     = lambda: stdin.readline().split()

s = ns()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N=input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
a=0 if s[0]==s[-1] else 1
print('YNeos'[a::2])

Submission status: Accepted

Solution code:
import math

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 == n[::-1]:
    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:
import sys
input = sys.stdin.readline

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

Submission status: Accepted

Solution code:
N = int(input())

i = N//100
j = (N - 100*i)//10
k = (N - 100*i - 10*j)

print("Yes" if i == k else "No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(N: int):
    s = str(N)
    print(YES if s[0] == s[2] else NO)


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)


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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
line = input()
if line == line[::-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:
s = 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()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = list(input())

if s == list(reversed(s)):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=int(input())
n1=list(str(n))
n2=n1.copy()
n2.reverse()
n3=int("".join(n2))
if n==n3:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
N=input()
n=[int(a) for a in N]
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()
k=[]
t=[]
for i in range(len(x)):
	k.append(x[i])
for i in range(len(x)):
	t.append(x[len(x)-i-1])

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

Submission status: Accepted

Solution code:
a = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
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()
n = len(N)
ok = 1
for i in range(n):
    if N[i] == N[n-i-1]:
        continue
    ok = 0
    break
if ok:
    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:
import sys
input = sys.stdin.readline

def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))

def main():
    mod=10**9+7
    S=input()
    if S[0]==S[2]:
        print("Yes")
    else:
        print("No")

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import os


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    a, b, c = str(sys.stdin.readline().rstrip())
    print("Yes" if a == c else "No")


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()

a = [c for c in s]
b = [c for c in s[-1::-1]]
answer = "Yes"
for i in range(len(a)):
  if a[i]  != b[i]:
    answer = "No"
    break
print(answer)

Submission status: Accepted

Solution code:
a = input()
if a[0] == a[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:
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:
#070_A
n=input()
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=input()
print('YNeos'[n[0]!=n[2]::2])

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

#----------
s = input().strip()
#----------
for i in range(len(s)//2+1):
    if s[i] != s[len(s)-1-i]:
        print("No")
        sys.exit()

print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())

N_h_place = N // 100
N_o_place = N % 10

ans = 'No'

if N_h_place == N_o_place:
    ans = 'Yes'

print(ans)

Submission status: Accepted

Solution code:
N=input()
flag=0
for i in range(int(len(N)/2)):
  if N[i]!=N[len(N)-1-i]:
    flag=1
    break
  
if flag==0:
  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 == n[::-1] else "No")

Submission status: Accepted

Solution code:
N = input()
M = N[::-1]
if M ==N:
    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())

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

Submission status: Accepted

Solution code:
a = input()
print("Yes" if a[0]==a[2] else "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 = 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()
if len(n)%2==0:
    m=int(len(n)/2)
else:
    m=int((len(n)-1)/2)

a=0

for i in range(m):
    if n[i]==n[-1*(i+1)]:
       continue
    else:
        a+=1

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

Submission status: Accepted

Solution code:
def changehi(n):

    return "Yes" if n[0] == n[-1] else "No"

def main():
    n = str(input())
    print(changehi(n))

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# 入力　数字（文字列として扱う）
N = input()

#出力　回文数ならYes
if N[0] == N[2] :
    print("Yes")
else :
    print("No")

Submission status: Accepted

Solution code:
n = input()
n1 = n[::-1]

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

Submission status: Accepted

Solution code:
N = int(input())
s = str(N)
t=""
for i in range(3):
    t = s[i]+t

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

Submission status: Accepted

Solution code:
n=list(input())
a=True
for i in range(len(n)//2):
    if n[i]!=n[len(n)-1-i]:
        a=False
        break
print('Yes' if a 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:
n = input()

rev_n = list(n)
rev_n.reverse()
rev_n = "".join(rev_n)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

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

print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32

YES = "Yes"  # type: str
NO = "No"  # type: str

def solve(N: int):
    if str(N) == str(N)[::-1]:
        print(YES)
    else:
        print(NO)
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    solve(N)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
N = input()
if N == N[2] + N[1] + N[0]:
    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:
"""
author : halo2halo
date : 29, Jan, 2020
"""

import sys
import itertools

# import numpy as np

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

x = readline().decode('utf8').rstrip()
print('Yes' if x == x[::-1] else 'No')

Submission status: Accepted

Solution code:
import math
import calendar
import fractions
import itertools

n = input()

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
b = a[-1::-1]
if a == b:
  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")
	exit()
else:
	print("No")
	exit()

Submission status: Accepted

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

Submission status: Accepted

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

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()
print("Yes" if n == "".join(reversed(n)) 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()
print("YNeos"[N!=N[::-1]::2])

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

Submission status: Accepted

Solution code:
def solve(s):

    for i in range(len(s)):
        if s[i] != s[-(i+1)]:
            return False
    return True

if __name__ == '__main__':
    s = input()
    if solve(s):
        print("Yes")
    else:
        print("No")

Submission status: Accepted

Solution code:
n=str(input())
nx=[i for i in n]
nx.reverse()
m="".join(nx)
if n==m:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

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

if(num.endswith(num[0])):
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:


import numpy as np

s=input()
if(s[0]==s[2]):
    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 = 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:
n = 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')