

from __future__ import annotations

SCREAMING_SNAKE_CASE_        =      []

def 							__SCREAMING_SNAKE_CASE							(				lowerCAmelCase:  list[list[int]]  ,      lowerCAmelCase:  int  ,      lowerCAmelCase:  int )   ->       bool:
				for i in range(len(lowerCAmelCase ) ):
								if board[row][i] == 1:
												return False
				for i in range(len(lowerCAmelCase ) ):
								if board[i][column] == 1:
												return False
				for i, j in zip(range(lowerCAmelCase  ,      -1  ,      -1 )  ,      range(lowerCAmelCase  ,      -1  ,      -1 ) ):
								if board[i][j] == 1:
												return False
				for i, j in zip(range(lowerCAmelCase  ,      -1  ,      -1 )  ,      range(lowerCAmelCase  ,      len(lowerCAmelCase ) ) ):
								if board[i][j] == 1:
												return False
				return True

def 							__SCREAMING_SNAKE_CASE							(				lowerCAmelCase:  list[list[int]]  ,      lowerCAmelCase:  int )   ->       bool:
				if row >= len(lowerCAmelCase ):
								solution.append(lowerCAmelCase )
								printboard(lowerCAmelCase )
								print()
								return True
				for i in range(len(lowerCAmelCase ) ):
								if is_safe(lowerCAmelCase  ,      lowerCAmelCase  ,      lowerCAmelCase ):
												_UpperCAmelCase       :		Optional[int] 		=    1
												solve(lowerCAmelCase  ,      row + 1 )
												_UpperCAmelCase       :		Tuple 		=    0
				return False

def 							__SCREAMING_SNAKE_CASE							(				lowerCAmelCase:  list[list[int]] )   ->       None:
				for i in range(len(lowerCAmelCase ) ):
								for j in range(len(lowerCAmelCase ) ):
												if board[i][j] == 1:
																print("Q"  ,      end=" " )
												else:
																print("."  ,      end=" " )
								print()


# n=int(input("The no. of queens"))
SCREAMING_SNAKE_CASE_        =      8
SCREAMING_SNAKE_CASE_        =      [[0 for i in range(n)] for j in range(n)]
solve(board, 0)





print('The total no. of solutions are :', len(solution))







from __future__ import annotations

import numpy as np

def 							__SCREAMING_SNAKE_CASE							(				lowerCAmelCase:  list[float] )   ->       Dict:
				return np.maximum(0  ,      lowerCAmelCase )


if __name__ == "__main__":
					print(np.array(relu([-1, 0, 5])))  # --> [0, 0, 5]


