Определить, какое количество клеток шахматного поля не заняты и не находятся под боем коней

m = int(input('количество коней: '))
n = int(input('размер поля: '))
xs = [x for x in range(n)]
ys = [x for x in range(n)]
for i in range(m):
    x = int(input(f'координата x{i}: '))
    y = int(input(f'координата y{i}: '))
    if x in xs:
        xs.remove(x+2)
        xs.remove(x-2)
        xs.remove(x+1)
        xs.remove(x-1)
    if y in ys:
        xs.remove(y+2)
        xs.remove(y-2)
        xs.remove(y+1)
        xs.remove(y-1)
print(len(xs) + len(ys))

def foo(f, h, v):
    nn = range(len(f))
    if h - 2 in nn and v + 1 in nn:
        f[h - 2][v + 1] = 1
    if h - 2 in nn and v - 1 in nn:
        f[h - 2][v - 1] = 1
    if h - 1 in nn and v - 2 in nn:
        f[h - 1][v - 2] = 1
    if h + 1 in nn and v - 2 in nn:
        f[h + 1][v - 2] = 1
    if h + 2 in nn and v - 1 in nn:
        f[h + 2][v - 1] = 1
    if h + 2 in nn and v + 1 in nn:
        f[h + 2][v + 1] = 1
    if h - 1 in nn and v + 2 in nn:
        f[h - 1][v + 2] = 1
    if h + 1 in nn and v + 2 in nn:
        f[h + 1][v + 2] = 1
 
 
n = int(input('Field size: '))
m = int(input('Horses amount: '))
field = [[0] * n for i in range(n)]
for i in range(m):
    x = int(input(f'x{i}: '))
    y = int(input(f'y{i}: '))
    field[x][y] = 1
    foo(field, x, y)
 
print(n * n - sum([sum(row) for row in field]))

x = int(input(f'x{i}: '))
y = int(input(f'y{i}: '))

x = int(input('x{i}: '.format(i=i)))
y = int(input('y{i}: '.format(i=i)))

x = int(input('x{}: '.format(i)))
y = int(input('y{}: '.format(i)))