




from __future__ import annotations







def 		lowercase__   (		__A:	list[int]							,__A:	list[int]							,__A:	list[int]							,__A:	list[list[str]]							,__A:	int							,):





					'''simple docstring'''






					__magic_name__							:	int    							=							len(__A				)

					# If row is equal to the size of the board it means there are a queen in each row in
					# the current board (possible_board)
					if row == n:
										# We convert the variable possible_board that looks like this: [1, 3, 0, 2] to
										# this: ['. Q . . ', '. . . Q ', 'Q . . . ', '. . Q . ']
										boards.append(['''. ''' * i + '''Q ''' + '''. ''' * (n - 1 - i) for i in possible_board]				)
										return

					# We iterate each column in the row to find all possible results in each row
					for col in range(__A				):
										# We apply that we learned previously. First we check that in the current board
										# (possible_board) there are not other same value because if there is it means
										# that there are a collision in vertical. Then we apply the two formulas we
										# learned before:
										#
										# 45º: y - x = b or 45: row - col = b
										# 135º: y + x = b or row + col = b.
										#
										# And we verify if the results of this two formulas not exist in their variables
										# respectively.  (diagonal_right_collisions, diagonal_left_collisions)
										#
										# If any or these are True it means there is a collision so we continue to the
										# next value in the for loop.
										if (
										    col in possible_board
										    or row - col in diagonal_right_collisions
										    or row + col in diagonal_left_collisions
										):
															continue

										# If it is False we call dfs function again and we update the inputs
										depth_first_search(
										    [*possible_board, col]							,[*diagonal_right_collisions, row - col]							,[*diagonal_left_collisions, row + col]							,__A							,__A							,)







def 		lowercase__   (		__A:	int				):





					'''simple docstring'''






					__magic_name__							:	list[list[str]]    							=							[]
					depth_first_search([]							,[]							,[]							,__A							,__A				)

					# Print all the boards
					for board in boards:
										for column in board:
															print(__A				)
										print(''''''				)

					print(len(__A				)							,'''solutions were found.'''				)


if __name__ == "__main__":
	import doctest

	doctest.testmod()
	n_queens_solution(4)









import requests







def 		lowercase__   (		__A:	str							,__A:	str				):





					'''simple docstring'''






					__magic_name__							:	Tuple    							=							{'''Content-Type''': '''application/json'''}
					__magic_name__							:	Union[str, Any]    							=							requests.post(__A							,json={'''text''': message_body}							,headers=__A				)
					if response.status_code != 2_0_0:
										__magic_name__							:	int    							=							(
										    '''Request to slack returned an error '''
										    F'''{response.status_code}, the response is:\n{response.text}'''
										)
										raise ValueError(__A				)


if __name__ == "__main__":
	# Set the slack url to the one provided by Slack when you create the webhook at
	# https://my.slack.com/services/new/incoming-webhook/
	send_slack_message('''<YOUR MESSAGE BODY>''', '''<SLACK CHANNEL URL>''')



