Learn Recursion by Solving the Tower of Hanoi Puzzle - Step 13

Tell us what’s happening:

I got stuck in this step. glad to have any feedback.
thanks

Your code so far

def move(n, source, auxiliary, target):
print(rods)

move(NUMBER_OF_DISKS, ‘A’, ‘B’, ‘C’)

NUMBER_OF_DISKS = 3
number_of_moves = 2**NUMBER_OF_DISKS - 1
rods = {
    'A': list(range(NUMBER_OF_DISKS, 0, -1)),
    'B': [],
    'C': []
}

def move(n, source, auxiliary, ):
def move(n, source, auxiliary, ):

# User Editable Region

def move(n, source, auxiliary, target):
    print(rods)

move(NUMBER_OF_DISKS, 'A', 'B', 'C')

# User Editable Region

Your browser information:

User Agent is: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/120.0.0.0 Safari/537.36 Edg/120.0.0.0

Challenge Information:

Learn Recursion by Solving the Tower of Hanoi Puzzle - Step 13

you have the function definition three times, that is a syntax error
maybe reset the step and try again?