Scam

You are given an array $A$ of length $N$, where each element is either a positive integer or the value $-1$. It is guaranteed that $A_1 \neq -1$. There are $N$ people, numbered from $1$ to $N$. - If $A_i \neq -1$, then person $i$ votes for the member numbered $A_i$. - If $A_i = -1$, then person $i$ looks at the prefix $A_1, A_2, \dots, A_i$ in the array and considers only the positions $j \le