【paiza問題集 解説】
戦セット

n = int(input())
if n >= 80:
    print('pass')
else:
    print('fail')

n = int(input())
print('pass' if n >= 80 else 'fail')

s1 = input()
s2 = input()
if s1 == s2:
    print('YES')
else:
    print('NO')

s1 = input()
s2 = input()
print('YES' if s1 == s2 else 'NO')

n = int(input())

time = n % 12
if time == 0:
    time = 12

print(time)

n = int(input())
print(n - 24)

n = int(input())
print(n % 24)

n = int(input())
weathers = {'forward': 'Sunny', 'sideways': 'Cloudy', 'reverse': 'Rainy'}

for _ in range(n):
    d = input()
    print(weathers[d])

m = int(input())

if m <= 5:
    print('raw')
elif m <= 7:
    print('soft boiled')
else:
    print('hard boiled')

s1, s2 = input().split()
print(s1[0] + '.' + s2[0] + '.')

s1, s2 = input().split()
print(f'{s1[0]}.{s2[0]}.')

n = int(input())

nums = []
for _ in range(n):
    a = int(input())
    
    if a % 2 == 1:
        nums.append(a)

print(*sorted(nums), sep='\n')

n = int(input())
nums = [a for _ in range(n) if (a:=int(input())) % 2 == 1]
print(*sorted(nums), sep='\n')

n = int(input())

memo = []
for _ in range(n):
    c = input()
    
    if c not in memo:
        print('YES')
        memo.append(c)
    else:
        print('NO')

n = int(input())

memo = set()
for _ in range(n):
    c = input()
    print('YES' if c not in memo else 'NO')
    memo.add(c)

def line_symmetry(plane):
    return ([row[::-1] for row in plane] == plane) or (plane[::-1] == plane)

def point_symmetry(plane):
    return [row[::-1] for row in plane[::-1]] == plane

def get_result(ls, ps):
    results = {
        ( True,  True) : 'line point symmetry',
        ( True, False) : 'line symmetry',
        (False,  True) : 'point symmetry',
        (False, False) : 'none'
    }
    return results[ls, ps]


n, _ = map(int, input().split())
d = [input() for _ in range(n)]
ls = line_symmetry(d)
ps = point_symmetry(d)
print(get_result(ls, ps))