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()
n_l = list(n)
reversed_l = []
for i in n_l[::-1]:
    reversed_l.append(i)
reversed_l = ''.join(reversed_l)
if n == reversed_l:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
a = int(input())
if 100 <= a <= 999:
    n = str(a)
    nlist = list(n)
    print('Yes' if nlist[0] == nlist[2] else 'No')
else:
    print('hoge!')

Submission status: Accepted

Solution code:
a = int(input())
if 100 <= a <= 999:
    n = str(a)
    nlist = list(n)
    rev = []
    for i in range(len(nlist)):
        rev.append(nlist[2 - i])
    print('Yes' if nlist == rev else 'No')
else:
    print('hoge!')

Submission status: Accepted

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

import sys
import math
import bisect
import time
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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:
print("Yes"if str(int(input())%101/10)[1:]==".0"else"No")

Submission status: Accepted

Solution code:
print("Yes" if str(int(input()) % 101 / 10)[1:] == ".0" else "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=input()
print("Yes" if a == c 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:
s=input()
if s==s[::-1]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
N = input()

half = len(N) // 2

if len(N)%2 == 0:
  left_N = N[:half]
  right_N = N[half:]
else:
  left_N = N[:half]
  right_N = N[half+1:]

for l,r in zip(left_N, right_N[::-1]):
  if l != r:
    print('No')
    exit()
    
print('Yes')

Submission status: Accepted

Solution code:
s = input()
print("Yes" if s[::-1]==s 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 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:
a,b,c=input();print('YNeos'[a!=c::2])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = list(input())

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

Submission status: Accepted

Solution code:
def main():
    N = input()
    if N[0] == N[-1]:
        return "Yes"
    return "No"


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

Submission status: Accepted

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

if __name__ == '__main__':
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()

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

Submission status: Accepted

Solution code:
N = list(input())
if N[0] == N[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()
f = True
L = len(N)
for i in range(L):
  if N[i] != N[L-1-i]:
    f = False
    break
if f:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# Palindromic Number
n = input()

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == "__main__":
    test()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

N = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, b, c = input().rstrip()
print('Yes' if a == c 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:
N = list(map(int, input()))
x = 0
for i in range(len(N) // 2):
  if N[i] != N[-i-1]:
    print('No')
    x = 1
    break
if x == 0:
  print('Yes')

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    n = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=list(input())
if(s[0]==s[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:
#A-Palindromic Number(ABC070)
N=input()
if N==N[::-1]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
import sys
from fractions import gcd
import bisect
 
stdin = sys.stdin
 
ns = lambda: stdin.readline().rstrip()
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
s = lambda h: [list(map(int, stdin.readline().split())) for i in range(h)]

n = ns()
ans = "Yes"
for i in range(1, int(len(n)/2)+1):
        if n[i-1] != n[-i]:
                ans = "No"
                break

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
inp = input()
#文字列を反転
inp_rev = "".join([char for char in reversed(list(inp))])
print("Yes" if inp == inp_rev 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:
lst = list(input())
if lst[0] == lst[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:
a, b, c =input()
print('Yes' if a==c else 'No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
print("Yes" if n==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:
n = input()

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

Submission status: Accepted

Solution code:
# a=sorted(list(map(int,input().split())))
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[2] or N[0]==N[1]==N[2] else "No")

Submission status: Accepted

Solution code:
S = list(input())
if list(reversed(S)) == S:
  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:
a, b, c = input()

if a==c:
  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('YNeos'[1-(a==a[::-1])::2])

Submission status: Accepted

Solution code:
a=list(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:
n=input()
print(("No","Yes")[n==n[::-1]])

Submission status: Accepted

Solution code:
number = input()

half_length = len(number)//2
count = 0
for letter in range(half_length):
    if number[letter] != number[-letter-1]:
        print("No")
        count += 1
        break

if count == 0:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N = list(input())
if N == 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,b,c=input()
print('Yes'  if a==c else  'No')

Submission status: Accepted

Solution code:
import math

num=int(input())

if num%10==math.floor(num/100):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
num=input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

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())
re = list(reversed(n))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#70

N = list(input())

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
INF = float("inf")


def yes():
    print("Yes")  # type: str


def no():
    print("No")  # type: str


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n1, n2, n3 = input()
print('Yes' if n1 == n3 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 == n[::-1]):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = input()
if num==num[::-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:
s = list(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 print("No")

Submission status: Accepted

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


if __name__ == '__main__':
    a, b, c = input()
    print('Yes' if a == c 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 = str(input())
print("Yes" if n[0] == n[2] else "No")

Submission status: Accepted

Solution code:
S = []
S = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a = int(input())
b = int(str(a)[::-1])
if(a == b):
    print("Yes")
else:
    print("No")

Submission status: Accepted

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


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

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

    if n == n_reversed:
        print("Yes")
        return

    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:
n = int(input())
t1 = int(n%10)
t2 = n%100 - t1
t3 = int((n -t2 -t1)//100)
print('Yes') if t1 == t3 else print('No')

Submission status: Accepted

Solution code:
x = input()
if int(x[0]) == int(x[-1]):
  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()
reverse_N = ''.join(list(reversed(N)))

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

Submission status: Accepted

Solution code:
## abc070a: Palindromic Number

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

Submission status: Accepted

Solution code:
## abc070a: Palindromic Number

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

Submission status: Accepted

Solution code:
## abc070a: Palindromic Number

s = [int(c) for c in input()]
l = 0
r = len(s)
f = True
while l<r-1:
    if s[l]!=s[r-1]:
        f=False
    l+=1
    r-=1
print('Yes' if f 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 = str(input())
if n[0] == n[2]:
  print('Yes')
else:
  print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
kazu = list(input())
if kazu[0] == kazu[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:
l = list(input())
if l[0] == l[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 = str(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:
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
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()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = input()
if N[0] == N[2]:
    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:
a = input()
for i in range(len(a)):
    if a[i] != a[-i-1]:
        print("No")
        exit()
print("Yes")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

Solution code:
import sys
pagos=0
lines = sys.stdin.readlines()
for linea in lines:
    c = linea.split()
    c = list(map(str,c))
list(c)
p = c[0]
texto = p
rever = texto[::-1]
if texto == rever:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
n=input()
cadena="{}{}{}".format(n[2],n[1],n[0])
if n==cadena:
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = str(input())
if N[0]==N[2]:
  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()

new_str = ''.join(list(reversed(a)))
if new_str == a:
    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:

N = input()
Nr = ""

for i in N:

    Nr = i + Nr

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

Submission status: Accepted

Solution code:
s=list(input())
u=s[::-1]
ans=0
for i in range(3):
    if u[i]==s[i]:
        ans+=1
if ans==3:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

# input
N = input()

# solve
ans = 'Yes' if N == N[::-1] else 'No'

# output
print(ans)

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    N = input()
    print('YNeos'[not N == N[::-1]::2])


main()

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()
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:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

N = s()

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

Submission status: Accepted

Solution code:


def main():
    a = input()
    b = a[::-1]
    if a == b:
        print('Yes')
    else:
        print('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:
n=list(input())
a=n[::-1]
if a==n:
    print("Yes")
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:
# coding: utf-8
# Your code here!

input_num = input()
input_len = len(input_num)
input_lis = list(input_num)
rvrsd_lis = list(reversed(input_lis))
flag = 0

#print(input_lis)
#print(rvrsd_lis)

for i in range(input_len):
    #print(input_lis[i])
    #print(rvrsd_lis[i])
    if input_lis[i] != rvrsd_lis[i]:
        flag = 1
        print("No")
        break

if flag == 0:
    print("Yes")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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 = list(input())
p = n[::-1]

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

Submission status: Accepted

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


abc()

Submission status: Accepted

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

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

def solve(N: int):
    if N % 10 == N // 100:
        ret = YES
    else:
        ret = NO
    print(ret)
    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:
moji = input()
if (moji[0]==moji[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:
# -*- coding: utf-8 -*-

s = input()

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

Submission status: Accepted

Solution code:
from copy import deepcopy as dp
s=list(input())
t=dp(s)
s.reverse()
if s==t:
  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()

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

Submission status: Accepted

Solution code:
# sys.stdin.readline()
import sys
input = sys.stdin.readline

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

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==n[::-1] else "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:
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    s = input()


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

solve()

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())
s = n.copy()
s.reverse()
print("Yes" if n==s else "No")

Submission status: Accepted

Solution code:
a = input()

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

Submission status: Accepted

Solution code:
n=input()

a=str(n)

if a[:1]==a[2:]:
    print("Yes")

else:
    print("No")

Submission status: Accepted

Solution code:
N = input()
list = []
for i in N:
    list.append(i)
list.reverse()
new = ''.join(list)
if new == 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:
inputStr = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S= input()
flag = True
for i in range(len(S)):
  if S[i] != S[len(S)-1-i]:
    flag = False
print ( "Yes" if flag else "No" )

Submission status: Accepted

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