Minimum OR Path

Harasees has an array $A$ of size $N$ containing non-negative integers. He starts at the index $1$ of $A$ and wants to reach the index $N$. In one move, he can do the following: - If he is currently at index $i$, then he can move to any index $j$ such that $i \le j \le \min(i + A_i, N)$. The cost of a path is defined as the [bitwise OR](https://en.wikipedia.org/wiki/Bitwise_operation#OR) of all