Number of Moves in Python

'''calculate the number of squares a Bishop can move'''
def calculate_moves(bishop,obstacles,n):
    
    moves = 0
    
    #diagonal moves from the current position
    top_left =  [-1,-1]
    top_right = [-1,1]
    bottom_left =  [1,-1]
    bottom_right = [1,1]

    diagonals = [top_left,top_right,bottom_left,bottom_right]

    for diagonal in diagonals:
        #move bishop over every diagonal
        position = [bishop[0]+diagonal[0], bishop[1]+diagonal[1]]

        #check whether the position is valid and position is not of any obstacle else hault 
        while( (position[0]>=1 and position[0]<=n)  and (position[1]>=1 and position[1]<=n) and position not in obstacles):
            moves += 1
            position = [position[0]+diagonal[0],position[1]+diagonal[1]]
    
    return moves


'''input'''
n = int(input("Enter N: "))
k = int(input("Enter number of Obstacles: "))
bishop = list(map(int,input("Position of Bishop: ").split(" ")))

obstacles = list()

print("Positions of Obstacles: ")
for i in range(k):
    r,c = input().split(" ")
    obstacles.append([int(r),int(c)])

'''output'''
print("Number of moves: ",calculate_moves(bishop,obstacles,n))