Positive Spewing

A **circular array** of length $N$ is defined as follows: $N$ integers $A_1,A_2,…,A_N$ are placed in a circle in such a way that for each $1 \leq i \lt N$, $A_i$ and $A_{i+1}$ are adjacent, and $A_1$ and $A_N$ are also adjacent. You are given a circular array $A$ of length $N$. At the end of each second, the following changes are executed in the array: If $A_i \gt 0$ then the elements which are a