#include <bits/stdc++.h>
using namespace std;

// macros
#define overload_rep(_1, _2 ,_3 ,name, ...) name
#define re_p(i, n) for(int i = 0; i < (n); ++i)
#define r_ep(i, x, y) for(int i = (x); i <= (y); ++i)
#define rep(...) overload_rep(__VA_ARGS__, r_ep, re_p)(__VA_ARGS__)
#define all(a) a.begin(), a.end()
#ifndef STOP_DEBUG
#define debug(...)\
    do { cerr << boolalpha << "[" << #__VA_ARGS__ << "]:";\
    debug_cerr(__VA_ARGS__); cerr << noboolalpha; } while (0)
#else
#define debug(...)
#endif

// functions
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }
void debug_cerr(){ cerr << '\n'; }
template<class Head, class... Tail>
void debug_cerr(Head head, Tail... tail){
    cerr << ' ' << head;
    debug_cerr(tail...);
}
template<typename T>
vector<T> make_v(size_t a, T b){ return vector<T>(a, b); }
template<typename... Ts>
auto make_v(size_t a, Ts... ts){
    return vector<decltype(make_v(ts...))>(a, make_v(ts...));
}

// cin/cout setup
struct IoSetup{
    IoSetup(){
        cin.tie(nullptr);
        ios::sync_with_stdio(false);
        cout << fixed << setprecision(20);
    }
} iosetup;

// libraries
template<const int_fast64_t mod = 1000000007>
struct ModInt{
private: using ll = int_fast64_t;
public: ll x;
    inline constexpr ModInt(ll t = 0) noexcept : x((t %= mod) < 0 ? t + mod : t) {}
    inline constexpr friend istream& operator >> (istream& s, ModInt& m) noexcept {
        s >> m.x; m.x %= mod; if(m.x < 0)m.x += mod; return s;
    }
    inline constexpr friend ostream& operator << (ostream& s, ModInt m) noexcept {
        return s << m.x;
    }
    inline constexpr ModInt operator + (const ModInt m) noexcept { return ModInt(*this) += m; }
    inline constexpr ModInt& operator += (const ModInt m) noexcept {
        if((x += m.x) >= mod)x -= mod; return *this;
    }
    inline constexpr ModInt operator - (const ModInt m) noexcept { return ModInt(*this) -= m; }
    inline constexpr ModInt& operator -= (const ModInt m) noexcept {
        if((x += mod - m.x) >= mod)x -= mod; return *this;
    }
    inline constexpr ModInt operator * (const ModInt m) noexcept { return ModInt(*this) *= m; }
    inline constexpr ModInt& operator *= (const ModInt m) noexcept {
        x = x * m.x % mod; return *this;
    }
    inline constexpr ModInt operator / (const ModInt m) noexcept { return ModInt(*this) /= m; }
    inline constexpr ModInt& operator /= (const ModInt m) noexcept {
        return *this *= m.inv();
    }
    inline constexpr ModInt inv() const noexcept {
        ll a = x, b = mod, u = 1, v = 0, t = 0;
        while(b){ t = a / b; a -= t * b; swap(a, b); u -= t * v; swap(u, v); }
        return ModInt(u);
    }
    inline constexpr ModInt pow(ll p) noexcept {
        ModInt res(1), mult(*this);
        for(; p; p >>= 1){ if(p & 1)res *= mult; mult *= mult; }
        return res;
    }
};

// declarations
using mint = ModInt<>;
const int mx = 1 << 20;

int N, A, X;
int cnt[mx];
struct status{ mint last, now, sum; };
status dp[mx];

// solve
int main(){

    cin >> N;
    rep(Kodaman, N){
        cin >> A;
        X ^= A;
        if(X == 0)cnt[0]++;
        else {
            int dif = cnt[0] - cnt[X];
            cnt[X] = cnt[0];
            dp[X].now += dp[X].sum * mint(dif);
            dp[X].last = dp[X].now + mint(1);
            dp[X].sum += dp[X].last;
        }
    }

    if(X == 0){
        mint ans;
        rep(i, mx)ans += dp[i].sum;
        cout << ans + mint(2).pow(cnt[0] - 1) << '\n';
    } else cout << dp[X].last << '\n';
    
}

Measured memory_bytes: 28928