Problem:


Score : 100 points

Problem Statement

You are given a grid with 2 rows and 3 columns of squares.
The color of the square at the i-th row and j-th column is represented by the character C_{ij}.

Write a program that prints YES if this grid remains the same when rotated 180 degrees, and prints NO otherwise.

Constraints

C_{i,j}(1 \leq i \leq 2, 1 \leq j \leq 3) is a lowercase English letter.

Input

Input is given from Standard Input in the following format:

C_{11}C_{12}C_{13}
C_{21}C_{22}C_{23}

Output

Print YES if this grid remains the same when rotated 180 degrees; print NO otherwise.

Sample Input 1

pot
top

Sample Output 1

YES

This grid remains the same when rotated 180 degrees.

Sample Input 2

tab
bet

Sample Output 2

NO

This grid does not remain the same when rotated 180 degrees.

Sample Input 3

eye
eel

Sample Output 3

NO



Sample input:
pot
top


Sample output:
YES

Submission status: Wrong Answer

Solution code:

C1 =str(input())
C2 =str(input())

if C1[0] == C2[2] and C1[1] == C2[1] and C1[2] == C2[0]:
    print('Yes')

else:
    print('No')

Submission status: Wrong Answer

Solution code:

C1 =str(input())
C2 =str(input())

if C1[0] == C2[2] and C1[1] == C2[1] and C1[2] == C2[0]:
    print('Yes')

else:
    print('No')

Submission status: Wrong Answer

Solution code:
# 2段目の文字列を逆にして1段目の文字列と一致すればいい
c = input('')
d = input('')

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

Submission status: Wrong Answer

Solution code:
first = input()
second = input()

if first[0] == second[2] and first[1] == second[1] and first[2] == second[0]:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
A = input()
B = input()
if A[0] == B[0] and A[1] ==B[1]  and A[2]== B[2]:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
a = list(map(str, input()))
b = list(map(str, input()))

if a[0] == b[0] and a[1] == b[1] and a[2] == b[2]:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
A = input()
B = input()
if A[0] == B[0] and A[1] ==B[1]  and A[2]== B[2]:
  print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a = list(map(str, input()))
b = list(map(str, input()))

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

Submission status: Wrong Answer

Solution code:
#入力例は合うがWAになる

a = input()
b = input()

# if [S[0],S[1],S[2]] == [T[2],T[1],T[0]]:
if [a[2],a[1],a[0]] == [b[0],b[1],b[2]]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
#入力例は合うがWAになる

S = input()
T = input()

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

Submission status: Wrong Answer

Solution code:
#入力例は合うがWAになる

S = input()
T = input()

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

Submission status: Wrong Answer

Solution code:
#入力例は合うがWAになる

S = str(input())
T = str(input())

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

Submission status: Wrong Answer

Solution code:
#入力例は合うがWAになる

S = str(input())
T = str(input())

if S[0]==T[2] and S[1]==T[1] and S[2]==T[0]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
#答えは合ってるがWAにならない

S = str(input())
T = str(input())

C = list(S)
D = list(T)
D.reverse()

if C == D:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:

c1=input()
c2=input()

if c1[0]+c1[1]+c1[2] == c2[2]+c2[1]+c2[0]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
#答えは合ってるがWAにならない

C1 = input()
C2 = input()

C = list(C1)
D = list(C2)
D.reverse()

if C == D:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
word1 = input()
word2 = input()
up = list(word1)
down = list(word2)

if up[0]==down[2] and up[1]== down[1] and up[2] == down[0]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
word1 = input()
word2 = input()
up = list(word1)
down = list(word2)

if word1[0]==word2[2] and word1[1]== word2[1] and word1[2] == word2[0]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
x = str(input())
y = str(input())

if x[0] == y[2] and x[1] == y[1] and x[2] == y[0]:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
x = list(str(input()))
y = list(str(input()))

if x[0] == y[2] and x[1] == y[1] and x[2] == y[0]:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
x = list(input())
y = list(input())

if x[0] == y[2] and x[1] == y[1] and x[2] == y[0]:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
x = list(input())
y = list(input())

if x[0] == y[2] and x[1] == y[1] and x[2] == y[0]:
    print('yes')
else:
    print('no')

Submission status: Wrong Answer

Solution code:
x = str(input())
y = str(input())

conditions = x[0] == y[2] and x[1] == y[1] and x[2] == y[0]

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

Submission status: Wrong Answer

Solution code:
a = input()
b = input()
if a == b[--1]:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
C123=list(input())
C456=list(reversed(input()))

if C123 == C456:
    print('YES')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
# 077a

def atc_077a(input_value: str) -> str:
    C1 = input_value[0]
    C2 = input_value[1]

    if C1[0] == C2[2] and C1[1] == C2[1]:
        return "YES"
    else:
        return "NO"

C1 = input()
C2 = input()
print(atc_077a([C1,C2]))

Submission status: Wrong Answer

Solution code:
C1 = str(input())
C2 = str(input())

if C1[0] == C2[-1] and C1[1] == C2[-2] and C1[2] == C2[-3]:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
C = str(input())

if C[0] == C[1] and C[1] == C[1] and C[1] == C[2]:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
C = str(input())

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

Submission status: Wrong Answer

Solution code:
data1 = input()
data2 = input()

count = 3 -1
sw = 0
i = 0
j = len(data2)-1
while i <= count:
    if data1[i] == data2[j]:
        sw += 1
    i += 1
    j -= 1
if sw == 3:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
data1 = input()
data2 = input()

count = len(data1) -1
sw = 0
i = 0
j = len(data2)-1
while i <= count:
    if data1[i] == data2[j]:
        sw += 1
    i += 1
    j -= 1
if sw == len(data1):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
data1 = input()
data2 = input()

count = len(data1) - 1
sw = 0
i = 0
j = len(data2)-1
while i <= count:
    if data1[i] == data2[j]:
        sw += 1
    i += 1
    j -= 1
if sw == len(data1):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
data1 = list(map(str, input().split()))
data2 = list(map(str, input().split()))

count = len(data1) - 1
sw = 0
i = 0
j = len(data2)-1
while i <= count:
    if data1[i] == data2[j]:
        sw += 1
    i += 1
    j -= 1
if sw == len(data1):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
data1 = list(map(str, input().split()))
data2 = list(map(str, input().split()))

count = len(data1) - 1
sw = 0
i = 0
j = len(data2)-1
while i <= count:
    if data1[i] == data2[j]:
        sw += 1
        print(data1[i],data2[j])
    i += 1
    j -= 1
if sw == len(data1):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
c1 = input()
c2 = input()

if c1[0] == c2[-1] and c1[1] == c2[-2] and c1[2] == c2[-3]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
# A - Rotation
line1 = input()
line2 = input()
my_list1 = []
my_list2 = []

for i in line1:
    my_list1.append(i)

for i in line2:
    my_list2.append(i)

my_list2.reverse()

if my_list1 == my_list2:
    print('YES')
else:
    print('No')

# print(my_list1, my_list2)

Submission status: Wrong Answer

Solution code:
# 文字列を取得
C1 = str(input())
C2 = str(input())

# 文字列の結合
ori_str = C1 + C2

# 末尾から１文字ずつ取得して逆さま文字を生成
rev_str = ori_str[-1::-1]

# 比較結果を出力
if ori_str == rev_str:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
C=input()+input()
print("YNEOS"[sum([1 for i in range(3)if C[i]!=C[-i-1]])::2])

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
x =[str(input()) for i in range(2)]
if x[0][0]==x[1][0] and x[0][1]==x[1][1] and x[0][2]==x[1][2]:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
s1 = input()
s2 = input()
if s1[0] == s2[2] and s1[1] == s2[1] and s1[2] == s2[0]:
  print("Yes")
else:
  print("No")

Submission status: Wrong Answer

Solution code:
s1 = input()
s2 = input()
if s1[0] == s2[2] and s1[1] == s2[1] and s1[2] == s2[0]:
  print("Yes")
print("No")

Submission status: Wrong Answer

Solution code:
up  = list(input())
down = list(input())

up.reverse()
if up == down:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
a=input()
b=input()
if a[0]==b[2] and a[1]==b[1]:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
C=[0,0]
C[0]=list(map(str,input()))
C[1]=list(map(str,input()))
ans="No"
X=C[0][::-1]
if C[1]==X:
    ans="Yes"
print(ans)

Submission status: Wrong Answer

Solution code:
a=input()
b=input()
print('YES' if a[0]==b[2] and a[2]==b[0] else 'NO')

Submission status: Wrong Answer

Solution code:
C1 = input()
C2 = input()
ans = 'YES'
if C1[0] != C2[2]:
  ans = 'NO'
if C1[1] != C2[1]:
  ans = 'NO'
if C1[2] != C2[1]:
  ans = 'NO'
print(ans)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
C1 = input()
R1 = C1[::-1]
C2 = input()
R2 = C2[::-1]
print(['No','Yes'][R2==C1 and R1==C2])

Submission status: Wrong Answer

Solution code:
a=input()
b=input()
if a[0]==b[2] and a[2]==b[2] and a[2]==b[0]:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
a=input()
b=input()
if a[0]==b[2] or a[2]==b[2] or a[2]==b[0]:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
t=list(input())
s=list(input())
if reversed(t)==s and reversed(s)==t:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
x =input()
y=input()
print('Yes' if x[2]+x[1]+x[0]==y else 'No')

Submission status: Wrong Answer

Solution code:
a = input()
b = input()
print("YES" if a[0] == b[2] or a[1] == b[1] or a[2] == b[0] else "NO")

Submission status: Wrong Answer

Solution code:
c1 = list(input())
c2 = list(input())

c1.reverse()

if c1 == c2:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
C1 = input()
#print(C1)
C2 = input()

if (C1[2] == C2[0]) and (C1[1] == C2[1]):
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
C1 = str(input().split())
#print(C1)
C2 = str(input().split())

#print(C1[4])

if (C1[4] == C2[2]) and (C1[3] == C2[3]):
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
C1 = str(input())
#print(C1)
C2 = str(input())

if C1[0]==C2[2] and C1[1]==C2[1]:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
c1 = input()
c2 = input()
if c1 == c2[-1:] and c2 == c1[-1:]:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
c1 = input().split()
c2 = input().split()
if c1 == c2[-1:] and c2 == c1[-1:]:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
import sys
C1 = list(input())
C2 = list(input())

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
C1 = list(input())
C2 = list(input())

if C1[0] == C2[2] and C1[2] == C2[0] and C1[2] == C2[2]:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
C1 = list(input())
C2 = list(input())

if C1[0] == C2[2] and C1[2] == C2[0]:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a=list(input())
b=list(input()).reverse()
print('NYOE S'[a==b::2])

Submission status: Wrong Answer

Solution code:
a=list(input())
b=list(input())
print('NYOE S'[a==b.reverse()::2])

Submission status: Wrong Answer

Solution code:
a = list(input().split())
b = list(input().split())
s = a + b
print("YES" if s == s[::-1] else "NO")

Submission status: Wrong Answer

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

b_reverse = a[::-1]

if a == b_reverse:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
c1 = input()
c2 = input()
if c1[0] == c2[2] and c1[1] == c2[1] and c1[2] == c2[0]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
c1 = input()
c2 = input()

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

Submission status: Wrong Answer

Solution code:
c1 = list(input())
c2 = list(input())

if c1[0] == c2[-1] and c1[-1] == c2[0] and c1[2] == c2[2]:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
c1 = list(input())
c2 = list(input())

if c1[0] == c2[-1] and c1[-1] == c2[0] and c1[2] == c2[2]:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
c1 = list(input())
c2 = list(input())

if c1[0] == c2[-1] and c1[-1] == c2[0]:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
C = [input() for _ in range(2)]
tmp = C[0] + C[1]
if tmp == tmp[::-1]:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
c1 = list(input())
c2 = list(input())

if c1[0] == c2[2] and c1[1] == c2[1] and c1[2] == c2[0]:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
c1 = list(input())
c2 = list(input())

print('Yes') if (c1[0] == c2[2] and c1[1] == c2[1] and c1[2] == c2[0]) else print('No')

Submission status: Wrong Answer

Solution code:
c1 = list(input())
c2 = list(input())

print('Yes') if (list(reversed(c1)) == c2 and list(reversed(c2)) == c1) else print('No')

Submission status: Wrong Answer

Solution code:
c1 = input()
c2 = input()
if c1[::-1]==c2:
    print('YES')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
N = list(input())
K = list(input())

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

Submission status: Wrong Answer

Solution code:
C11C12C13=input()
C21C22C23=input()
if (C11C12C13[0]==C21C22C23[2] and C11C12C13[2]==C21C22C23[0] and C11C12C13[1]==C21C22C23[1]):
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
c1 = list(input())
c2 = list(input())
if c1 == reversed(c2):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:

c = input()
d = input()

print("YES" if c==c[::-1] and d==d[::-1] else "NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s1 = input()
s2 = input()
print("YES") if s1 == s2[::-1] else print("No")

Submission status: Wrong Answer

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

s = list(input())
t = list(input())
t2 = ""
for i in range(len(t)):
    t2+=t[len(t)-i-1]
if s == t2:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a,b=input(),input()
print('YES' if reversed(list(a))==list(b)else 'NO')

Submission status: Wrong Answer

Solution code:
if input()==input()[:-1:-1]:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
a,b=input()[:-1],input()
print('YES' if reversed(list(a))==list(b)else 'NO')

Submission status: Wrong Answer

Solution code:
S1=input()
S2=input()
ans=1
for i in range(3):
  if S1[i]!=S2[2-i]:
    ans*0
print(["NO","YES"][ans])

Submission status: Wrong Answer

Solution code:
import numpy as np

up_ = np.array(list(reversed(input())))
lo = np.array(list(input()))

if (up_ == lo).all():
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
import numpy as np

up_ = np.array(list(reversed(input())))
lo = np.array(list(input()))

if (up_ == lo).any():
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
C1 = list(input())
C2 = list(input())
if C1[0] == C2[2] and C1[1] == C2[1] and C1[2] == C2[0]:
    print('YES')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    return int(input())
def s(x): #圧縮
    a = []
    if len(x) == 0:
        return []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): #listをスペースごとに分ける
    return " ".join(map(str,x))
def max2(x): #他のときもどうように作成可能
    return max(map(max,x))
def In(x,a): #aがリスト(sorted)
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False

def pow_k(x, n):
    ans = 1
    while n:
        if n % 2:
            ans *= x
        x *= x
        n >>= 1
    return ans

"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""

s = [list(input())[:-1] for i in range(2)]

for i in range(3):
    if s[0][i] != s[1][2-i]:
        print("NO")
else:
    print("YES")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
c1=input()
c2=input()
print("YES" if c1==c2[::-1] else "No")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
print('YES') if input()[::1]==input() else print('NO')

Submission status: Wrong Answer

Solution code:
line1 = str(input())
line2 = str(input())

newline1 = line2[::-1]
newline2 = line1[::-1]

if newline1==line1 and line2==newline2:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
s1 = input()
s2 = input()

if s1[0] == s2[2] and s1[1] == s2[1] and s1[2] == s2[0]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
a = input()
b = input()
if (a[0] == b[2])and(b[0] == a[2]):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
def main():
    s1 = input()
    s2 = input()

    s2 = s2[::-1]

    print('Yes' if s1 == s2 else 'No')

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
row1 = input()
row2 = input()

if row1[0] == row2[2] and row1[1] == row2[1] and row1[2] == row2[0]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
import math



a=input()
b=input()


print("YES" if a[0]==b[2] and b[0] ==a[2] else "NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=str(input())
b=str(input())
if a[0]==b[2] and a[2]==b[0]:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
s1=input()
s2=input()
flag=0
x=s1[::-1]
if x==s1:
    flag=1
if flag==0:
    print("NO")
else:
    print("YES")

Submission status: Wrong Answer

Solution code:
l1=input().split()
l2=input().split()
l2.reverse()
if l1==l2:
 print('YES')
else:
 print('NO')

Submission status: Wrong Answer

Solution code:
row1 = input()
row2 = input()

r1 = row1[::-1]
r2 = row2[::-1]

if(row1 == r2 and row2 == r1):
    print("YES")
else:
    print("NO")
    
print("This grid remains the same when rotated 180 degrees.")

Submission status: Wrong Answer

Solution code:
S1 = list(input())
S2 = list(input())

flag = 0
for i in range(3):
  if S1[i] != S2[2-i]:
    flag = 1

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

Submission status: Wrong Answer

Solution code:
if __name__=="main":
    a=list(input())
    b=list(input())
    a.reverse()
    if(a==b):
        print('YES')
    else:
        print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
import sys

a = input()
b = input()

for i in range(2):
    if a[i] != b[2 - i]:
        print("NO")
        sys.exit()
print("YES")

Submission status: Wrong Answer

Solution code:
l = input()
m = input()
if l[0] == m[2] and l[1] == m[1] and l[2] == l[0]:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
c = input()
C = input()

if c[0] == C[-1] and c[-1] == C[0]:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
c1 = list(input())
c2 = list(input())
if c1.reverse == c2:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
i = list(input())
t = list(input())
for _ in range(3):
  a = i.pop(-1)
  i.insert(0, a)
if i == t:
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
a = input()
b = input()
if a==reversed(b):
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
st1=str(input())
st2=str(input())
for i in range(3):
  if st1[i]!=st2[2-i]:
    print('NO')
  if i==2:
    print('YES')

Submission status: Wrong Answer

Solution code:
C=[list(input()) for i in range(2)]
N=C[1].reverse()
if C[0]==N:
    print('YES')
else:
    print('NO')

Submission status: Wrong Answer

Solution code:
def rotation(c , c2):

    return "Yes" if c == c2[-1] + c2[1] + c2[0] else "No"

def main():
    c = str(input())
    c2 = str(input())
    print(rotation(c , c2))

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
c1=input()
c2=input()
c2_rev=c2[::-1]
if c1==c2_rev:
    print("YES")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
s_a = input()
s_b = input()
if s_a[0] == s_b[2] and s_a[2] == s_a[0] and s_a[1] == s_b[1]:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S=str(input())
T=str(input())
print('Yes' if S[0]==T[2] and S[1]==T[1] and S[2]==T[0] else 'No')

Submission status: Wrong Answer

Solution code:
C=list(open(0).read())
print('YES')if C[:3] == C[-1:-4:-1] else print('NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
A = input()
D = input()
if A[0] == D[2] and A[1] == D[1] and A[2] == D[0]:
    print("Yes")
else:
    print("No")

Submission status: Wrong Answer

Solution code:
c1 = input()
c2 = input()
if c1[0] == c2[2] and c1[1] == c2[1] and c1[2] == c2[0]:
    print('Yes')
else:
    print('No')

Submission status: Wrong Answer

Solution code:
A=str(input())
B=str(input())
if A[0]==B[2] and A[1]==B[1] and A[2]==B[2]:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
c = [input() for _ in range(2)]

if c[0][1] == c[1][1] and sorted(c[0]) == sorted(c[1]):
	print("YES")
	exit()
else:
	print("NO")

Submission status: Wrong Answer

Solution code:
c = [input() for _ in range(2)]

if c[0][1] == c[1][1] and sorted(c[0]) == sorted(c[1]):
	print("Yes")
else:
	print("No")

Submission status: Wrong Answer

Solution code:
c1 = input()
c2 = input()

if c1[0] == c2[2] and c1[1] == c2[1] and c1[2] == c2[0]:
    print('Yes') 
else:
    print('No')

Submission status: Wrong Answer

Solution code:


import numpy as np

s=[input() for k in range(2)]
for i in range(3):
    if(s[0][i]!=s[1][2-i]):
        print("No")
        exit(0)
print("Yes")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a = list(input())
b = list(input())


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

Submission status: Wrong Answer

Solution code:
c1=input()
c2=input()
if c1[0]==c2[2] and c1[1]==c2[1] and c1[2]==c2[0]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

Solution code:
a = list(input())
b = list(input())
b.reverse()
print('Yes' if a == b else 'No')

Submission status: Wrong Answer

Solution code:
import sys

x = input()
y = input()

if x == x[::-1]:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
import sys

x = input()
y = input()

if x == reversed(y):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
a=input()
x='YES' if input()==reversed(a) else 'NO'
print(x)

Submission status: Wrong Answer

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

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

Submission status: Wrong Answer

Solution code:
A = input()
B = input()

REA = (A[0] + A[1] + A[2])
REB = (A[2] + A[1] +A[0])

if REA == REB:
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s=input()
t=input()
a=0
for i in range(3):
    if s[i]!=t[-i-1]:
        a=1
print('Yes' if a==0 else 'No')

Submission status: Wrong Answer

Solution code:
S=input()
T=input()
if (S[0]==T[2] and T[0]==S[2]):
  print("YES")
else:
  print("NO")

Submission status: Wrong Answer

Solution code:
C1 = [i for i in input()]
C2 = [i for i in input()]
if C1 == C2.reverse():
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

Solution code:
ls_c = [[i for i in input()] for j in range(2)]

if (ls_c[0][0] == ls_c[1][2]) and (ls_c[0][2] == ls_c[1][0]):
    print("YES")
else:
    print("NO")

Submission status: Wrong Answer

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

c = list(a)
d = list(b)

if c[0]==d[2] and c[1]==d[1] and c[2]==d[0]:
	print('Yes')
else:
	print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
a=list(input())
b=list(input())
if a[0]==b[2] and a[1]==b[1] and a[2]==b[2]:
  print('YES')
else:
  print('NO')

Submission status: Wrong Answer

Solution code:
print('YES' if input()==reversed(input()) else 'NO')

Submission status: Wrong Answer

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

 
a_reversed = ''.join(list(reversed(a)))
b_reversed = ''.join(list(reversed(b)))


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

Submission status: Wrong Answer

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

 
a_reversed = ''.join(list(reversed(a)))
b_reversed = ''.join(list(reversed(b)))


if a == ''.join(b_reversed) and b == ''.join(a_reversed):
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

a_reversed = sorted(a, reverse=True)
b_reversed = sorted(b, reverse=True)

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

Submission status: Wrong Answer

Solution code:
c1=input()
c2=input()

if c1==c2[::-1] and c2==c1[::-1]:
  print('Yes')
else:
  print('No')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s = input()
j = input()
print('YES' if s[0]==j[2] and s[2]==j[2] and s[2]==j[0]  else 'NO')

Submission status: Wrong Answer

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

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
C = [input() for _ in range(2)]

print('Yes' if C[0][0] == C[1][2] and C[0][1] == C[1][1] and C[0][2] == C[1][0] else 'No')