human
Sum of sides of largest and smallest child polygons possible from a given polygon | Function to find the sum of largest and smallest secondary polygons if possible.
Count edges of primary polygon.
Calculate edges present in the largest secondary polygon.
Driver Code.
Given Exterior Angle"
How can the above be solved in Python?

Write me a code to sum of sides of largest and smallest child polygons possible from a given polygon and the other steps required?
assistant
#Here is code to sum of sides of largest and smallest child polygons possible from a given polygon and the other steps required.
 def secondary_polygon ( Angle ) :
	edges_primary = 360 // Angle
	if edges_primary >= 6 :
		edges_max_secondary = edges_primary // 2
		return edges_max_secondary + 3
	else :
		return " Not ▁ Possible "
if __name__ == ' _ _ main _ _ ' :
	Angle = 45
	print ( secondary_polygon ( Angle ) )