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

B = A[::-1]
flag = True
for i in range(len(A)):
    if A[i] != B[i]:
        flag = False
        break

if flag: 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/python3
# -*- coding: utf-8 -*-


"""
https://beta.atcoder.jp/contests/abc070/tasks/abc070_a
"""

import sys
import math
from inspect import currentframe

def debug(*args):
    names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}
    print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args), file=sys.stderr)

N = int(input())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()

b=list(a)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input().rstrip()
n2 = N[::-1]

print('Yes' if N == n2 else'No')

Submission status: Accepted

Solution code:
A = input()

if A == A[::-1]:
    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 = int(input())
if N % 10 == N // 100:
     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:
s = input();print("Yes" if s == s[::-1] else "No")

Submission status: Accepted

Solution code:
N = raw_input()
print "Yes" if N == "".join(reversed(N)) else "No"

Submission status: Accepted

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

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()
M = N[2] + N[1] + N[0]
if N == M:
	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:
a=int(input())
if a//100==a%10:
  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_str = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding: utf-8
N = input()
print(["No", "Yes"][N==N[::-1]])

Submission status: Accepted

Solution code:
inputS = input()
listN = list(str(inputS))
listM = list(str(inputS))
listM.reverse()
if listN == listM:
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
N = int(input())

a = N//100
b = N-(N//10)*10

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

Submission status: Accepted

Solution code:
print("YNeos"[not int(input())%101 in range(0,100,10)::2])

Submission status: Accepted

Solution code:
print("Yes" if int(input())%101 in range(0,100,10) else "No")

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
n  = input()

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

Submission status: Accepted

Solution code:
n = int(input())

n100 = n // 100
n1 = (n % 100) % 10

#print(n100)
#print(n1)

if n100 == n1:
    print("Yes")

else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]

def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
i = int(input()) # 整数

if((i // 100) == i % 10):
    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()
if a[0]==a[2]:print("Yes")
else:print("No")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x,y,z=map(int, input())
if x==z:
	print("Yes")
else:
	print("No")

Submission status: Accepted

Solution code:
import sys
import math
import collections
import itertools
import array
import inspect

# Set max recursion limit
sys.setrecursionlimit(10000)


# Debug output
def chkprint(*args):
    names = {
        id(v): k
        for k, v in inspect.currentframe().f_back.f_locals.items()
    }
    print(', '.join(
        names.get(id(arg), '???') + ' = ' + repr(arg) for arg in args))


# Binary converter
def to_bin(x):
    return bin(x)[2:]


def li_input():
    return [int(_) for _ in input().split()]


# --------------------------------------------

dp = None


def main():
    N = input()

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


main()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#70a
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:
N = input()
R = ''.join(reversed(N))
print('Yes' if N == R 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()
if N[0] == N[2] :
    print("Yes")
else :
    print("No")

Submission status: Accepted

Solution code:
D = input()
if D[0] == D[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:
# vim: set fileencoding=utf-8 :
n = str(raw_input())  # 100<= n <= 999

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = list(input())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8
n=str(input())
if(n[0]==n[2]):
  print("Yes")
else:
  print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

top = N[0]
bottom = N[2]

if top == bottom:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
N = input()
if int(N) == int(N[::-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:
# -*- coding: utf-8 -*-

N = input()

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

Submission status: Accepted

Solution code:
# input
N = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

n = input()
print(['Yes', 'No'][n[0] != n[2]])

Submission status: Accepted

Solution code:
x=input()
print("Yes" if x[0]==x[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:
print(["Yes","No"][(lambda x:bool(x/100-x%10))(input())])

Submission status: Accepted

Solution code:
print(["Yes","No"][(lambda x:bool(x//100-x%10))(input())])

Submission status: Accepted

Solution code:
print(["Yes","No"][(lambda x:(abs(x//100-x%10)+99)//100)(input())])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def isP (s):
    n = len(s)
    for i in range(0, int(n/2)):
        if s[i] != s[n-i-1]:
            return False
    return True

S = input()

result = "Yes" if isP(S) else "No"

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(raw_input())
print ['No', 'Yes'][n % 10 is n / 100]

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

Submission status: Accepted

Solution code:
def judge(s):
	if s[0] == s[2]: return 'Yes'
	else: return 'No'

print judge(raw_input())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()
if list(a) ==list(reversed(a)): 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 (["No","Yes"][N[0] == N[2]])

Submission status: Accepted

Solution code:
a = int(input())

if a//100 == a%10:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()
flag = False
for i in range(len(n)//2):
    if n[i] != n[-(i+1)]:
        flag = True

if flag:
    print("No")
else:
    print("Yes")

Submission status: Accepted

Solution code:
N = input()
R = ''
for i in range(len(N)):
    R += N[-(i+1)]
if R == N:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
import sys

def getinputdata():

    # 配列初期化
    array_result = []
    
    data = input()

    
    array_result.append(data.split(" "))

    flg = 1

    try:


        while flg:

            data = input()

            array_temp = []

            if(data != ""):
                
                array_result.append(data.split(" "))

                flg = 1

            else:

                flg = 0
    finally:


        return array_result





arr_data = getinputdata()

n = arr_data[0][0]


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

Submission status: Accepted

Solution code:
N = input()

NS = int(N)
NR = int(''.join(reversed(list(N))))

print('Yes' if NS == NR 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=list(input())
if a[0]==a[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:
# -*- coding: utf-8 -*-

# AtCoder Beginner Contest
# Problem A

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
n = input()
if n==''.join(reversed(n)):
    print('Yes')
else:
    print('No')

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:
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=list(map(int,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()

def parin(s):
    while len(s) > 1:
        if s[0] == s[-1]:
            s = s[1:-1]
        else:
            return False
    return True
if parin(n):
    print("Yes")
else:
    print("No")

Submission status: Accepted

Solution code:
N=list(input())


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = input()

rv = n[::-1]
if n == rv:
  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()
import sys
for i in range(len(n)//2):
    if n[i] != n[len(n)-1-i]:
        print('No')
        sys.exit(0)

print('Yes')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(("Yes","No")[len(set(input()[::2]))-1])

Submission status: Accepted

Solution code:
n=list(map(int,input()))
re=n[::-1]
for i in range(len(n)):
    if n[i]==re[i]:
        print("Yes")
        break
    else:
        print("No")
        break

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 python

N = list(map(int, list(input())))

ans = "Yes"
for top in range(len(N)):
    last = len(N) - 1 - top
    
    if top >= last:
        break

    if N[top] != N[last]:
        ans = "No"
        break
    
print(ans)

Submission status: Accepted

Solution code:
na = list(input())
nb = na[:]
nb.reverse()
if na == nb:
    print('Yes')
else:
    print('No')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input().rstrip()
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 = list(int(i) for i in 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()
lst = list(N)
if lst[0] == lst[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())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()
A = int(N[0])
B = int(N[1])
C = int(N[2])
if A==C:
 print("Yes")
else:
 print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n = int(input())

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

Submission status: Accepted

Solution code:
n = input()

a = [i for i in n]
b = [i for i in reversed(n)]

if a == b:
    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:
if __name__ == '__main__':
    N = int(input())
    a = int(N/100)
    b = int(N/10)-a*10
    c = N - (a*100 + b*10)
    ans = c*100 + b*10 + a
    if ans == N:
        print('Yes')
    else:
        print('No')

Submission status: Accepted

Solution code:
a = input()
a = str(a)

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

Submission status: Accepted

Solution code:
print "Yes" if (lambda x: x == x[::-1])(raw_input()) 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()
if N == N[-1::-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:
n = int(input())
a = 0
for i in range(1,10):
	if 100 * i <= n:
		a += 1
if a == n % 10:
	print('Yes')
else:
	print('No')

Submission status: Accepted

Solution code:
from collections import defaultdict
from itertools import product, groupby
from math import pi
from collections import deque
from bisect import bisect, bisect_left, bisect_right
INF = 10 ** 10


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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8
# Here your code !
import sys
a=input()
if a==a[::-1]:
    print("Yes")
else:
    print("No")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S=list(map(int, input()))

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

Submission status: Accepted

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


def is_palindromic(num_txt):
    return num_txt[0] == num_txt[-1]


def main():
    num_txt = input().strip()
    result = is_palindromic(num_txt)
    if result:
        print('Yes')
    else:
        print('No')


if __name__ == '__main__':
    main()

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\n")
else:
    print("No\n")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(): # 070A - Palindromic Number
    n = list(input())
    tmp = n.copy()
    tmp.reverse()
    if n == tmp:
        print("Yes")
    else:
        print("No")
        
        
solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
x = input()
if x[0] == x[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:
import sys

N = input()

for i in range(len(N)):
  if N[i] != N[len(N)-1-i]:
    print("No")
    sys.exit()

print("Yes")

Submission status: Accepted

Solution code:
a = list(input())
rev_a = list(a)
rev_a.reverse()

if a == rev_a:
    print("Yes",end='')
else:
    print("No",end='')

Submission status: Accepted

Solution code:
a = list(input())
rev_a = list(a)
rev_a.reverse()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

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

print('Yes')

Submission status: Accepted

Solution code:
S = input()
print('Yes' if S == S[::-1] 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:
import sys

for inp in map(str, [line.strip() for line in sys.stdin]):
	lenip = len(inp)
	if lenip%2==0:
		print "Yes" if inp[:lenip/2] == inp[lenip/2:][::-1] else "No"
	else:
		print "Yes" if inp[:lenip/2] == inp[(lenip+1)/2:][::-1] else "No"

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = input()

n = len(N)
result="Yes"

for i in range(n//2):
    if N[i] != N[n-i-1]:
        result="No"
        break

print(result)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    n = input()

    flag = True
    s, e = 0, len(n)
    while (s < e//2):
        if n[s] != n[e-s-1]:
            flag=False
            break
        s += 1
    if flag:
        print("Yes")
    else:
        print("No")
        

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
s = input()

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

Submission status: Accepted

Solution code:
N = int (input( ))

N_100 = N // 100
N = N - 100 * N_100
N_10 = N // 10
N = N - 10 * N_10
N_1 = N

if  N_100 == N_1:
    print ('Yes')
else :
    print ('No')

Submission status: Accepted

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

A = int(input())

if(int(A/100) == int(A%10)):
    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()
str_N = str(N)
rev_N = str_N[::-1]

if str_N == rev_N:
    print('Yes')
else:
    print('No')

Submission status: Accepted

Solution code:
def main():
    N = input()
    
    #print(N)
    #print(N[::-1])
    if(N == N[::-1]):
        print("Yes")
    else:
        print("No")
    
if __name__=="__main__":
    main()

Submission status: Accepted

Solution code:
s = input()
a = len(s)
i = 0
for i in range(a):
    if s[i] == s[a - 1 - i]:
        b = 1
    else:
        b = 0
        break


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

Submission status: Accepted

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

Submission status: Accepted

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