#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
using u64 = uint_fast64_t;
using pii = pair<int, int>;
using pll = pair<long long, long long>;
#define rep(i, n) for(int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()
constexpr char ln =  '\n';
constexpr long long MOD = 1000000007;
//constexpr long long MOD = 998244353;
template<class T1, class T2> inline bool chmax(T1 &a, T2 b) { if (a < b) { a = b; return true;} return false; }
template<class T1, class T2> inline bool chmin(T1 &a, T2 b) { if (a > b) { a = b; return true;} return false; }
inline int popcount(int x) {return __builtin_popcount(x);}
inline int popcount(long long x) {return __builtin_popcountll(x);}
void print() { cout << "\n"; }
template<class T, class... Args>
void print(const T &x, const Args &... args) {
    cout << x << " ";
    print(args...);
}
///////////////////////////////////////////////////////////////////////////////////////////////////////////////

template <uint_fast64_t Modulus> 
struct ModInt {
    using u64 = uint_fast64_t;

    u64 a;

    constexpr ModInt(const long long x = 0) noexcept : a(x >= 0 ? x % Modulus : (Modulus - (-x) % Modulus) % Modulus) {}
    constexpr u64 &value() noexcept {return a;}
    constexpr const u64 &value() const noexcept {return a;}
    constexpr ModInt operator+(const ModInt rhs) const noexcept {return ModInt(*this) += rhs;}
    constexpr ModInt operator-(const ModInt rhs) const noexcept {return ModInt(*this) -= rhs;}
    constexpr ModInt operator*(const ModInt rhs) const noexcept {return ModInt(*this) *= rhs;}
    constexpr ModInt operator/(const ModInt rhs) const noexcept {return ModInt(*this) /= rhs;}
    constexpr ModInt operator^(const long long rhs) const noexcept {return ModInt(*this) ^= rhs;}
    constexpr bool operator==(const ModInt &rhs) const noexcept {return a == rhs.a;}
    constexpr bool operator!=(const ModInt &rhs) const noexcept {return a != rhs.a;}
    constexpr ModInt &operator+=(const ModInt rhs) noexcept {
        a += rhs.a;
        if (a >= Modulus) {
            a -= Modulus;
        }
        return *this;
    }
    constexpr ModInt &operator-=(const ModInt rhs) noexcept {
        if (a < rhs.a) {
            a += Modulus;
        }
        a -= rhs.a;
        return *this;
    }
    constexpr ModInt &operator*=(const ModInt rhs) noexcept {
        a = a * rhs.a % Modulus;
        return *this;
    }
    constexpr ModInt &operator/=(ModInt rhs) noexcept {
        u64 exp = Modulus - 2;
        while (exp) {
            if (exp&1) *this *= rhs;
            exp >>= 1;
            rhs *= rhs;
        }
        return *this;
    }
    constexpr ModInt &operator^=(long long exp) noexcept {
        ModInt rhs = a;
        a = 1;
        while (exp) {
            if (exp&1) *this *= rhs;
            exp >>= 1;
            rhs *= rhs;
        }
        return *this;
    }

    friend ostream &operator<<(ostream& os, const ModInt& rhs) noexcept {return os << rhs.a;}
    friend istream &operator>>(istream& is, ModInt& rhs) noexcept {long long a; is >> a; rhs = a; return is;}
};

using mint = ModInt<MOD>;

const int MAX = 1<<20;
int main() {
    ios::sync_with_stdio(false); cin.tie(nullptr);
    int N; cin >> N;
    vector<int> A(N);
    rep(i,N) cin >> A[i];

    vector<int> B(N+1);
    rep(i,N) B[i+1] = B[i]^A[i];
    if (B[N]!=0) {
        mint cnt0 = 0, cntk = 0;
        rep(i,N-1) {
            if (B[i+1]==B[N]) {
                cntk += cnt0+1;
            } else if (B[i+1]==0) cnt0 += cntk;
        }
        cout << cnt0+1 << ln;
        return 0;
    }
    vector<vector<int>> G(MAX);
    rep(i,N-1) {
        G[B[i+1]].emplace_back(i+1);
    }
    
    mint ans = 0;
    for (int i = 1; i < MAX; i++) {
        if (G[i].empty()) continue;
        int K = G[i].size();
        mint val = 1, zero = 0;
        rep(j,K-1) {
            int l = lower_bound(all(G[0]),G[i][j]) - G[0].begin();
            int r = lower_bound(all(G[0]),G[i][j+1]) - G[0].begin();
            zero += val*(r-l);
            val += zero+1;
        }
        ans += val;
    }
    // set<int> dic;
    // vector<mint> cntk(MAX),cnt0(MAX);
    // int c = 0;
    // rep(i,N-1) {
    //     if (B[i+1] != 0) {
    //         cntk[B[i+1]] += cnt0[B[i+1]]+1;
    //         dic.emplace(B[i+1]);
    //     } else {
    //         for (auto j : dic) {
    //             cnt0[j] += cntk[j];
    //         }
    //         c++;
    //     }
    // }

    // for (int i = 1; i < MAX; i++) {
    //     ans += cntk[i];
    // }
    ans += mint(2)^(int)G[0].size();

    cout << ans << ln;
}

Measured memory_bytes: 38388