human
21 Matchsticks Problem | Function to return the optimal strategy.
Removing matchsticks in blocks of five.
Driver code"
Solution in Python:

Give me a code to 21 Matchsticks Problem and the other steps required?
assistant
#Here is code to 21 Matchsticks Problem and the other steps required.
 def TwentyoneMatchstick ( arr , N ) :
	for i in range ( N ) :
		print ( 5 - arr [ i ] , end = " ▁ " )
arr = [ 3 , 4 , 2 , 2 ]
N = len ( arr )
TwentyoneMatchstick ( arr , N )