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: Accepted

Solution code:
A=input();B=input()
for i in range(len(A)):
    j=2-i
    if A[i]!=B[j]:
        print('NO')
        exit()
print('YES')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(3):
  if C1[i] != C2[2-i]:
    print("NO")
    break
else:
  print("YES")

Submission status: Accepted

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

Submission status: Accepted

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

c1 = list(input())
c2 = list(input())

c2.reverse()

if c1 == c2:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=[input() for x in range(2)]
print('YES' if s[0] == s[1][::-1] else 'NO')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
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: Accepted

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

Submission status: Accepted

Solution code:
# https://atcoder.jp/contests/abc077/tasks/abc077_a

import itertools
import collections
import bisect

def main():
    c1 = input()
    c2 = input()
    c1r = ''.join(list(reversed(c1)))
    c2r = ''.join(list(reversed(c2)))
    print("YES" if c1 == c2r and c2 == c1r else "NO")

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

Solution code:
s,t=[input() for _ in range(2)]
print("YES" if s[0]==t[2] and s[1]==t[1] and s[2]==t[0] else "NO")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c11, c12, c13 = input()
c21, c22, c23 = input()
if c11 == c23 and c12 == c22 and c13 == c21:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
print("YES" if input() == "".join(list(reversed(input()))) else "NO")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c=input()
c2=input()
flag=True
for i in range(3):
  if c[i:i+1]!=c2[2-i:3-i]:
    flag=False
if flag:
  print("YES")
else:
  print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


def main():
    c1 = input()
    c2 = input()
    if c1 == c2[::-1] and c2 == c1[::-1]:
        print('YES')
    else:
        print('NO')


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def rotation(C: list) -> bool:
    for n in range(3):
        if C[0][n] != C[1][2-n]:
            return False
    return True


if __name__ == "__main__":
    C = [list(map(str, input())) for _ in range(2)]
    yes = rotation(C)
    print('YES' if yes else 'NO')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC77
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: Accepted

Solution code:
import sys

def main():
    input = sys.stdin.readline
    U = [str(c) for c in input().strip()]
    D = [str(c) for c in input().strip()]

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

for i in range(2):
    for j in range(3):
        if C[i][j] != C[1-i][2-j]:
            print("NO")
            sys.exit()

print("YES")

Submission status: Accepted

Solution code:
c = str(input())
d = str(input())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = []
b = []
a = str(input())
b = str(input())

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

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

Solution code:
l1 = list(input())
l2 = list(input())
print("YES") if (l1[0] == l2[2]) & (l1[1] == l2[1]) & (l1[2] == l2[0]) else print("NO")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from heapq import heappush, heappop
import sys
import math
import bisect
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return list(sys.stdin.readline())
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
mod = 1000000007

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = SR()
    return l
mod = 1000000007

#A
def A():
    s = S()
    t = S()
    if s+t == t[::-1]+s[::-1]:
        print("YES")
    else:
        print("NO")

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == "__main__":
    A()

Submission status: Accepted

Solution code:
import math

def A():
    a, b = [int(x) for x in input().split()]
    print(math.ceil((a + b)/2))

def B():
    a = ''.join(sorted(list(input()), key=lambda x:ord(x)))
    b = ''.join(sorted(list(input()), key=lambda x:-ord(x)))
    if a < b:
        print('Yes')
    else:
        print('No')

def C():
    N = input()
    A = [x for x in input().split()]
    counter = {}

    for a in A:
        if(a in counter):
            counter[a] += 1
        else:
            counter[a] = 1
    remove_count = 0
    for key in counter:
        if counter[key] - int(key) >= 0:
            remove_count += counter[key] - int(key)
        else:
            remove_count += counter[key]
    print(remove_count)

def E():
    s1 = input()
    s2 = input()
    if s1 == s2[::-1]:
        print('YES')
    else:
        print('NO')
E()

Submission status: Accepted

Solution code:
s = input()
t = input()
flag = True
for i in range(3):
    if s[i] != t[2 - i]:
        flag = False
if flag:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
b = input()
for i in range(3):
    if a[i] != b[2-i]:
        print('NO')
        exit()
print('YES')

Submission status: Accepted

Solution code:
C1 = input()
C2 = input()
for i in range(len(C1)):
  if C1[i] != C2[-1-i]:
    print("NO")
    break
else:
  print("YES")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    X = input()
    Y = input()
    if X[0] == Y[2] and X[1] == Y[1] and X[2] == Y[0]:
        print("YES")
    else:
        print("NO")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
S = input()
T = input()
ans = "NO"
if(S[::-1] == T and S == T[::-1]):
  ans = "YES"
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

Solution code:
s1=input()
s2=input()
print('YES' if s1[2]+s1[1]+s1[0]==s2 else 'NO')

Submission status: Accepted

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

Submission status: Accepted

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

if(c1 == c2):
  print('YES')
else:
  print('NO')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
C1 = input()
C2 = input()
print(['NO', 'YES'][C1[0] == C2[2] and C1[1] == C2[1] and C1[2] == C2[0]])

Submission status: Accepted

Solution code:
c1=list(input())
c2=list(input())
for i in range(3):
    if c1[i]!=c2[-1-i]:
        print("NO")
        break
else:
    print("YES")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
C1=str(input())
C2=str(input())
if C1==(C2[2]+C2[1]+C2[0]):
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

isMatch = True
for i in range( len(S1) ):
    if S1[i] != S2[-i-1]:
        isMatch = False
        break

if isMatch: print( 'YES' )
else:       print( 'NO' )

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
c1 = list(stdin.readline().rstrip())
c2 = list(stdin.readline().rstrip())
if c1[0]==c2[2] and c1[1]==c2[1] and c1[2]==c2[0]:
  print('YES')
else:
  print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

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

if C == CC[2]+CC[1]+CC[0] and CC == C[2]+C[1]+C[0]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:

s1=input()
s2=input()
print('YES' if s1[::-1] == s2 else 'NO')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s, t = [input() for _ in range(2)]
print("YES") if s == t[::-1] else print("NO")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c1_1 = input()
c1_2 = input()
c2_1 = c1_1[::-1]
c2_2 = c1_2[::-1]

if c1_1 == c2_2 and c1_2 == c2_1:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
Cs = [input(), input()]

ans = Cs[0][0] == Cs[1][2] and Cs[0][1] == Cs[1][1] and Cs[0][2] == Cs[1][0]

print("YES" if ans else "NO")
print()

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

Solution code:
import math
import numpy as np
import sys
input = sys.stdin.readline
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

l = S()[:-1]
rel = S()[-2::-1]

if l == rel:
    print("YES")
else:
	print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A=input()
B=input()
C=(A[::-1])
D=(B[::-1])
if C==B and D==A:
	print('YES')
else:
	print('NO')

Submission status: Accepted

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: Accepted

Solution code:
# 077
C = [raw_input() for _ in range(2)]
if C[0][::-1]==C[1]:
  print "YES"
else:
  print "NO"

Submission status: Accepted

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: Accepted

Solution code:
f = list(input())
s = list(input())
for i in range(3):
  if f[i] != s[2-i]:
    print("NO")
    exit()
print("YES")

Submission status: Accepted

Solution code:
s1=list(input())
s2=list(input())
a=[s1,s2]
for x in range(3):
    if a[0][x]!=a[1][2-x]:
        print("NO")
        exit()
print("YES")

Submission status: Accepted

Solution code:
c = input()
d = input()
if ''.join(list(reversed(c))) == d:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
c = list(map(str,input()))
d = list(map(str,input()))
if c == d[::-1]:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
c = list(map(str,input()))
d = list(map(str,input()))
if c[0] == d[2] and c[1] == d[1] and c[2] == d[0]:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
array1 = [a for a in input()]
array2 = [b for b in input()]
ar = [array1, array2]

r_array1 = array1[::-1]

if array2 == r_array1:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
list_1=list(input())
list_2=list(input())
#print(list_1[0],list_2[2])
if(list_1[0]==list_2[2] and list_1[1]==list_2[1] and list_1[2]==list_2[0]):
  print('YES')
else:print('NO')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# Luis Yoichi Morales January 2019

from sys import stdin

h=[]
for i in range (2):
    h.append( stdin.readline().split() )

if h[0][0] == h[1][0][::-1] and h[1][0] == h[0][0][::-1]:
    print 'YES'
else:
    print 'NO'

Submission status: Accepted

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

for i in range(len(C1) // 2):
  C1[i],C1[-1-i] = C1[-1-i],C1[i]
  
if C1 == C2:
  print('YES')
else:
  print('NO')

Submission status: Accepted

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

c2 = c2[::-1]
if c == c2:
  print('YES')
else:
  print('NO')

Submission status: Accepted

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

if C1[::-1]==C2:
  print('YES')
else:
  print('NO')

Submission status: Accepted

Solution code:
upper = input()
lower = input()

rev_lower = ('').join([i for i in lower[::-1] ])

if upper == rev_lower:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
""" AtCoder """

c = input()
cc = input()

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

Submission status: Accepted

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: Accepted

Solution code:
a = [input() for _ in range(2)]
if a[0][0] == a[1][2] and a[0][1] == a[1][1] and a[0][2] == a[1][0]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
ok=True
b = []
for i in range(2):
    b.append(input())
for i in range(3):
    if b[0][i]!=b[1][2-i]:
        ok=False
print("YES" if ok else "NO")

Submission status: Accepted

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

c1 = list(input())
c2 = list(input())

c1.reverse()

if c1 == c2:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
u = input()
u2 = ''
l = input()
for i in range(2, -1, -1):
    u2 += u[i]
if u2 == l:
    print('YES')
else:
    print('NO')

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

c1 = input()
c2 = input()

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

Submission status: Accepted

Solution code:
A = [input() for _ in range(2)]
for i in range(2):
    for j in range(3):
        if A[i][j] != A[1-i][2-j]:
            print('NO')
            exit()
else:
    print('YES')

Submission status: Accepted

Solution code:
c = [list(input().rstrip()) for _ in [0]*2]
for i in range(3):
    if c[0][i] == c[1][-(i+1)]: continue
    else:
        print('NO')
        break
else: print('YES')

Submission status: Accepted

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

for i in range(2):
    for j in range(3):
        if M[i][j] != M[1-i][2-j]:
            print('NO')
            exit()
else:
    print('YES')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c1 = list(input())
c2 = list(input())
for i in range(3):
    if c1[i]!=c2[2-i]:
        print("NO")
        exit()
print("YES")

Submission status: Accepted

Solution code:
def main() :

	a = input()
	b = input()

	for i in range(len(b)) :
		if (a[i] != b[-1 * i - 1]) :
			print("NO")
			return

	print("YES")

main()

Submission status: Accepted

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

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

Submission status: Accepted

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: Accepted

Solution code:
print(["NO","YES"][input().strip()[::-1]==input().strip()])

Submission status: Accepted

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

if C2 == C1[::-1]:
    print('YES')
else:
    print('NO')

Submission status: Accepted

Solution code:
def main():
  a = input()
  b = input()
  
  if a[0] == b[2]:
    if a[1] == b[1]:
      if a[2] == b[0]:
        print('YES')
        return
  print('NO')
  return

if __name__ == '__main__':
  main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
a = stdin.readline().rstrip()
b = stdin.readline().rstrip()
if b[::-1] == a and a[::-1] ==b:
 print('YES')
else:
 print('NO')

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c = [input() for _ in range(2)]
if c[0][::-1] == c[1]:
    print("YES")
else:
    print("NO")

Submission status: Accepted

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: Accepted

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

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

Submission status: Accepted

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

Solution code:
a=input()
b=input()
print(["NO","YES"][b==a[::-1] and a==b[::-1]])

Submission status: Accepted

Solution code:
A = input()
B = input()
C = (A, B)
ans = (B[::-1], A[::-1])
if(C == ans):
  print("YES")
else:
  print("NO")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def abc077_a():
    c = [list(input()) for _ in range(2)]
    if c[0][0] == c[1][2] and c[0][1] == c[1][1] and c[0][2] == c[1][0]:
        print("YES")
    else:
        print("NO")


abc077_a()

Submission status: Accepted

Solution code:
#A Rotation
a = input()
b = input()
if a[::-1] == b:
    print("YES")
    
else:
    print("NO")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,b,c=map(str,input().replace(""," ").split())
e,f,g=map(str,input().replace(""," ").split())
if a==g and b==f and c==e:
    print("YES")
else:
    print("NO")

Submission status: Accepted

Solution code:
def main():
    c1 = input()
    c2 = input()
    if c1[0] == c2[2] and c1[1] == c2[1] and c1[2] == c2[0]:
        print('YES')
    else:
        print('NO')


if __name__ == '__main__':
    main()

Submission status: Accepted

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: Accepted

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

Submission status: Accepted

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: Accepted

Solution code:
c = [list(input()) for _ in range(2)]
if c[0][0] == c[1][2] and c[0][1] == c[1][1] and c[0][2] == c[1][0]:
    print('YES')
else: 
    print('NO')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
S = str(input())
T = str(input())
if T[::-1] == S:
  print("YES")
else:
  print("NO")

Submission status: Accepted

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

Submission status: Accepted

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


def main():
    """Function."""
    x1 = str(input())
    x2 = str(input())
    c11, c12, c13 = x1[0], x1[1], x1[2]
    c21, c22, c23 = x2[0], x2[1], x2[2]

    if c11 == c23 and c12 == c22 and c13 == c21:
        print("YES")
    else:
        print("NO")


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
from statistics import mean, median,variance,stdev
import sys
import math

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: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input()
b = input()
b = ''.join([i for i in reversed(b)])
if a == b:
        print('YES')
else:
        print('NO')

Submission status: Accepted

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

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

Submission status: Accepted

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

print('YES' if C1==C2[::-1] else 'NO')

Submission status: Accepted

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

if(C1 == C2[::-1]):
    print('YES')

else:
    print('NO')

Submission status: Accepted

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

for i in range(3):
    if(C1[i] == C2[2-i]):
        continue

    else:
        print('NO')
        exit()

print('YES')

Submission status: Accepted

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

Submission status: Accepted

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

for i in range(3):
    if a[i:i+1] != b[2-i:3-i]:
        print('NO')
        break
else:
    print('YES')

Submission status: Accepted

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

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

Submission status: Accepted

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

a=list(a)
b=list(b)

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