Problem:
Score : 300 points

Problem Statement

Snuke has N hats. The i-th hat has an integer a_i written on it.

There are N camels standing in a circle.
Snuke will put one of his hats on each of these camels.

If there exists a way to distribute the hats to the camels such that the following condition is satisfied for every camel, print Yes; otherwise, print No.

The bitwise XOR of the numbers written on the hats on both adjacent camels is equal to the number on the hat on itself.

What is XOR?

The bitwise XOR x_1 \oplus x_2 \oplus \ldots \oplus x_n of n non-negative integers x_1, x_2, \ldots, x_n is defined as follows:

- When x_1 \oplus x_2 \oplus \ldots \oplus x_n is written in base two, the digit in the 2^k's place (k \geq 0) is 1 if the number of integers among x_1, x_2, \ldots, x_n whose binary representations have 1 in the 2^k's place is odd, and 0 if that count is even.

For example, 3 \oplus 5 = 6.

Constraints

All values in input are integers.

3 \leq N \leq 10^{5}

0 \leq a_i \leq 10^{9}

Input

Input is given from Standard Input in the following format:

N
a_1 a_2 \ldots a_{N}

Output

Print the answer.

Sample Input 1

3
1 2 3

Sample Output 1

Yes

If we put the hats with 1, 2, and 3 in this order, clockwise, the condition will be satisfied for every camel, so the answer is Yes.

Sample Input 2

4
1 2 4 8

Sample Output 2

No

There is no such way to distribute the hats; the answer is No.

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Wrong Answer)

import java.util.Scanner;

//https://atcoder.jp/contests/agc035/tasks/agc035_d
public class Main {
    private static long[] a;

    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int n = sc.nextInt();
        a = new long[n];
        for (int i = 0; i < n; i++) {
            a[i] = sc.nextInt();
        }
        System.out.println(solve(0, n, 1, 1));
    }

    /*
    reduce the interval of a into 2 cards. What is the minimum value of the left card
    multiplied by leftCoef, plus the right c card multiplied by rightCoef
     */
    private static long solve(int l, int r, int leftCoef, int rightCoef) {
        assert l + 1 < r;
        if (l + 2 == r) {
            return a[l] * leftCoef + a[r - 1] * rightCoef;
        }
        long ans = Long.MAX_VALUE;
        for (int mid = l + 1; mid < r - 1; mid++) {
            long bestSolutionThisMid;
            if (mid - l == 1 && r - mid == 2) {
                bestSolutionThisMid = leftCoef * (a[l] + a[mid]) + rightCoef * (a[mid] + a[r - 1]);
            } else if (mid - l == 1 && r - mid != 2) {
                bestSolutionThisMid = leftCoef * a[l] + leftCoef * 2 * a[mid] + rightCoef * a[mid] +
                        +solve(mid + 1, r, leftCoef + rightCoef, rightCoef);
            } else if (mid - l != 1 && r - mid == 2) {
                bestSolutionThisMid = solve(l, mid, leftCoef, leftCoef + rightCoef) +
                        leftCoef * a[mid] + rightCoef * 2 * a[mid] + rightCoef * a[r - 1];
            } else {
                bestSolutionThisMid = solve(l, mid, leftCoef, 2 * leftCoef + rightCoef) +
                        3 * leftCoef * a[mid] + 2 * rightCoef * a[mid] +
                        solve(mid + 1, r, leftCoef + rightCoef, rightCoef);

                bestSolutionThisMid = Math.min(bestSolutionThisMid,
                        solve(l, mid, leftCoef, leftCoef + rightCoef)
                                + 2 * leftCoef * a[mid] + 3 * rightCoef * a[mid]
                                + solve(mid + 1, r, leftCoef + 2 * rightCoef, rightCoef));
            }
            ans = Math.min(bestSolutionThisMid, ans);
        }
        return ans;
    }
}