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


#define li          long long int
#define rep(i,to)   for(li i=0;i<((li)(to));i++)
#define repp(i,start,to)    for(li i=(li)(start);i<((li)(to));i++)
#define pb          push_back
#define sz(v)       ((li)(v).size())
#define bgn(v)      ((v).begin())
#define eend(v)     ((v).end())
#define allof(v)    (v).begin(), (v).end()
#define dodp(v,n)       memset(v,(li)n,sizeof(v))
#define bit(n)      (1ll<<(li)(n))
#define mp(a,b)     make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 1000000007
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1


#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b)     idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)       idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j)        idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v)   for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x)      idp p2((x).F, (x).S)
#define dump(x,n)   idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n)  idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x)    idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x)   idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}

#define read2d(a,w,h)   rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h)   rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}

typedef pair<li, li> PI;


li n;
li a[500500];
li sum[500500];
li zeros[500500];

map<li, vector<li>> pos;

// x^y
inline li njo(li x, li y) {
    if (y == 0) return 1;
    if (y == 1)return x;
    li res = njo(x * x % MOD, y / 2);
    if (y % 2 > 0) {
        res = (res * x) % MOD;
    }
    return res;
}

inline li solve(vector<li>& p) {
    //
    li prev[2] = {0};
    li now[2] = {0};
    prev[0] = 1;
    prev[1] = 0;
    li prev_pos = 0;
    for (auto && pos : p) {
        li zero_num = zeros[pos] - zeros[prev_pos];
        now[0] = (prev[0] + prev[1] * zero_num) % MOD;
        now[1] = (now[0] + prev[1]) % MOD;
        prev_pos = pos;
        //p7(pos, zero_num, prev[0], prev[1], " -> " , now[0], now[1]);
        prev[0] = now[0];
        prev[1] = now[1];
    }
    return now[1] % MOD;
}


inline li solve1(vector<li>& p) {
    //
    li prev[2] = {0};
    li now[2] = {0};
    prev[0] = 1;
    prev[1] = 0;
    li prev_pos = 0;
    for (auto && pos : p) {
        if (pos == p.back()) break;
        li zero_num = zeros[pos] - zeros[prev_pos];
        now[0] = (prev[0] + prev[1] * zero_num) % MOD;
        now[1] = (now[0] + prev[1]) % MOD;
        prev_pos = pos;
        prev[0] = now[0];
        prev[1] = now[1];
    }
    li zero_num = zeros[n + 1] - zeros[prev_pos];
    return (prev[0] + prev[1] * zero_num) % MOD;
}

inline li solve0() {
    li cnt_0 = 0;
    repp(i, 1, n + 1) {
        if (sum[i] == 0) {
            cnt_0++;
        }
    }
    return njo(2, cnt_0 - 1);
}

int main() {
    cin >> n;
    rin{
        cin >> a[i];
    }
    sum[0] = 0;
    zeros[0] = 0;
    rin{
        sum[i + 1] = sum[i] ^ a[i];
    }
    rep(i, n + 1) {
        zeros[i + 1] = zeros[i] + (sum[i] == 0);
    }

    rep(i, n + 1) {
        pos[sum[i]].pb(i);
    }

    li res = 0;
    if (sum[n] > 0) {
        res += solve1(pos[sum[n]]);
    } else {
        for (auto && p : pos) {
            if (p.F == 0) {
                //p2(p.F, solve0());
                res = (res + solve0()) % MOD;
            } else {
                //cout << p.F << " -> ";
                //dumpi(p.S);
                li now = solve(p.S);
                //p2(p.F, now);
                res = (res + now) % MOD;
            }
        }
    }
    //dump(sum, n + 1);
    cout << res << endl;

    return 0;
}

Measured memory_bytes: 44784