Шахматы

import re
a = input()
b = re.search(r"..-..", a)
c = {
    "A": 1,
    "B": 2,
    "C": 3,
    "D": 4,
    "E": 5,
    "F": 6,
    "G": 7,
    "H": 8
}
 
try:
    if b[0]:
        x1 = int(c[b[0][0]])
        y1 = int(b[0][1])
        x2 = int(c[b[0][3]])
        y2 = int(b[0][4])
        dx = abs(x1 - x2)
        dy = abs(y1 - y2)
 
        if dx == 1 and dy == 2 or dx == 2 and dy == 1:
            print('YES')
        else:
            print('NO')
 
except KeyError:
    print("ERROR")
 
except TypeError:
    print("ERROR")

def check_move(move: str) -> str:
    allowed = 'ABCDEFGH'
    current, new = move.split('-')
    current_y = int(current[1])
    new_y = int(new[1])
    if current_y not in range(1, 9) or new_y not in range(1, 9) or current[0] not in allowed or new[0] not in allowed:
        return 'ERROR'
    variants = (lambda x, y, x1, y1: abs(x - x1) == 1 and abs(y - y1) == 2,
                lambda x, y, x1, y1: abs(x - x1) == 2 and abs(y - y1) == 1)
    for variant in variants:
        if variant(allowed.index(current[0]) + 1, current_y, allowed.index(new[0]) + 1, new_y):
            return 'YES'
    return 'NO'
 
 
if __name__ == '__main__':
    assert check_move('D9-C0') == 'ERROR'
    assert check_move('J7-C1') == 'ERROR'
    assert check_move('D8-C0') == 'ERROR'
    assert check_move('E2-E4') == 'NO'
    assert check_move('C3-C1') == 'NO'
    assert check_move('C3-E1') == 'NO'
    assert check_move('C3-B1') == 'YES'
    assert check_move('C3-D1') == 'YES'
    assert check_move('C3-A2') == 'YES'
    assert check_move('C3-E2') == 'YES'
    assert check_move('C3-A4') == 'YES'
    assert check_move('C3-E4') == 'YES'
    assert check_move('C3-B5') == 'YES'
    assert check_move('C3-D5') == 'YES'
    assert check_move('C7-D5') == 'YES'

import re
s = input()
if re.match(r'^[A-H][1-8]-[A-H][1-8]$', s):
    x1, y1, _, x2, y2 = map(ord, s)
    if (x1-x2)**2+(y1-y2)**2 == 5:
        print('YES')
    else:
        print('NO')
else:
    print('ERROR')