#include <iostream>
#include <vector>

const int MOD = 1e9 + 7;

int main() {
    int n;
    std::cin >> n;
    std::vector<long long> a(n);
    
    for (int i = 0; i < n; ++i) {
        std::cin >> a[i];
    }
    
    std::vector<long long> xorSum(n + 1, 0);
    std::vector<long long> dp(n + 1, 0);
    dp[0] = 1;  // Base case: one way to partition an empty sequence
    
    for (int i = 1; i <= n; ++i) {
        xorSum[i] = 0;
        for (int j = i; j > 0; --j) {
            xorSum[j] ^= a[i - 1];
            dp[i] = (dp[i] + dp[j - 1] * xorSum[j]) % MOD;
        }
    }
    
    std::cout << dp[n] << std::endl;
    
    return 0;
}