Problem Description:

In a magical land, there are $50$ lights lined up in a row, all initially tumed off. A wizard visits the land and performs the following enchantment:

On the first pass, the wizard toggles $($turns on if off, turns off if on$)$ every light. On the second pass, the wizard toggles every second light $($L$2,$ L$4,$ L$6,...).$ On the third pass, the wizard toggles every third light $(L3,L6,L9,$dots$).$ This pattern continues until the wizard completes $50$ passes, toggling the $50$ th light. Write a program to simulate this enchantment and determine which lights are tumed on at the end.