21768번 - AND PLUS OR 서브태스크스페셜 저지다국어

For two nonnegative integers $a, b$, let $a \wedge b$ be their bitwise AND, and $a \vee b$ be their bitwise OR.

You are given an array $A_0, A_1, \ldots, A_{2^N - 1}$ of length $2^N$ consisting of nonnegative integers. Please find a pair of indices $0 \le i, j \le 2^N - 1$ such that $A_{i} + A_{j} < A_{i \wedge j} + A_{i \vee j}$, or state that no such pair exists. If there is more than one such pair, print any.

The first line contains an integer $N$.

The second line contains $2^N$ integers, the array $A$ given in order.

If there is an answer, output two integers $i, j$ denoting the answer, separated by spaces. $i, j$ should be in the range $[0, 2^N - 1]$. Otherwise, output -1.

• $0 \leq N \leq 20$
• $0 \leq A_i \leq 10^7$

This subtask has an additional constraint.

• $N \le 14$

This subtask has an additional constraint.

• $N \le 17$

This subtask has no additional constraints.