import std.stdio;
import std.bigint;
import std.array;

enum MOD = 1_000_000_007;

void main() {
    // 读取输入
    int n;
    readf(" %d", &n);
    auto a = new ulong[n];
    foreach (i; 0 .. n) {
        readf(" %d", &a[i]);
    }

    auto result = calculatePartitionSum(n, a);
    writeln(result);
}

BigInt calculatePartitionSum(int n, ulong[] a) {
    auto prefixXor = new ulong[n + 1];
    auto dp = new BigInt[n + 1];
    dp[0] = BigInt(1); // Base case: one way to partition an empty sequence

    // 计算前缀异或
    for (int i = 1; i <= n; ++i) {
        prefixXor[i] = prefixXor[i - 1] ^ a[i - 1];
    }

    for (int i = 1; i <= n; ++i) {
        dp[i] = BigInt(0);
        for (int j = 1; j <= i; ++j) {
            ulong xorValue = prefixXor[i] ^ prefixXor[j - 1];
            dp[i] = (dp[i] + dp[j - 1] * BigInt(xorValue)) % MOD;
        }
    }

    return dp[n];
}