Binary Inscription

Given a binary string $S$ consisting of only 1’s and 0’s where 1 represents a **Square** and 0 represents a **Circle**. The *diameter of the circle* and the *side of the square* must be any *integer* (obviously > 0) . You will have to **perfectly inscribe** (as shown in the example below) the respective geometric figure at $S$$i+1$ inside of $S$$i$ where $i$ $\epsilon$ $[0,N-2]$, **if it is possib