LEAST NUMBER OF MOVES

You have $n$ squares. You are given a binary string squares of length $n$. where squares[i] is $0$ if the i-th square is empty, and $1$ if the i-th square contains a ball. In one operation you can move only one ball from a square to an adjacent square, square $i$ is adjacent to square $j$ if abs$(i-j)$==1. - Note: After doing so, there may be more than one ball in some squares. Print t