Bessie wants to go to sleep, but the farm's lights are keeping her awake. How can she turn them off?

Bessie has two bit strings of length N (2≤N≤20), representing a sequence of lights and a sequence of switches, respectively. Each light is either on (1) or off (0). Each switch is either active (1) or inactive (0).

A *move* consists of the following sequence of operations:

1. Toggle exactly one switch (set it to active if it is inactive, or vice versa).

2. For each active switch, toggle the state of the corresponding light (turn it off if it is on, or vice versa).

3. Cyclically rotate the switches to the right by one. Specifically, if the bit string corresponding to the switches is initially s₀s₁… s_N-1 then it becomes s_N-1s₀s₁…s_N-2.

For T (1≤T≤2⋅10⁵) instances of the problem above, count the minimum number of moves required to turn all the lights off.

#5473 upload - done - how_to_reg -

Lights Off timer 4s memory 1024MB

#5473

Lights Off 4s 1024MB