#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
const int INF = 1ll << 50;
const int MOD = 1e9 + 7;
#define dump(x)                             \
    if (dbg) {                              \
        cerr << #x << " = " << (x) << endl; \
    }
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
template <class T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return 1;
    } else
        return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    } else
        return 0;
}
void Yes(bool flag = true) {
    if (flag)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}
void No(bool flag = true) {
    Yes(!flag);
}
void YES(bool flag = true) {
    if (flag)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}
void NO(bool flag = true) {
    YES(!flag);
}
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define vi vector<int>
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define itn int
#define asn ans
bool dbg = false;
template <uint MD>
struct ModInt {
    using M = ModInt;
    const static M G;
    uint v;
    ModInt(ll _v = 0) { set_v(_v % MD + MD); }
    M& set_v(uint _v) {
        v = (_v < MD) ? _v : _v - MD;
        return *this;
    }
    explicit operator bool() const { return v != 0; }
    M operator-() const { return M() - *this; }
    M operator+(const M& r) const { return M().set_v(v + r.v); }
    M operator-(const M& r) const { return M().set_v(v + MD - r.v); }
    M operator*(const M& r) const { return M().set_v(ull(v) * r.v % MD); }
    M operator/(const M& r) const { return *this * r.inv(); }
    M& operator+=(const M& r) { return *this = *this + r; }
    M& operator-=(const M& r) { return *this = *this - r; }
    M& operator*=(const M& r) { return *this = *this * r; }
    M& operator/=(const M& r) { return *this = *this / r; }
    bool operator==(const M& r) const { return v == r.v; }
    M pow(ll n) const {
        M x = *this, r = 1;
        while (n) {
            if (n & 1)
                r *= x;
            x *= x;
            n >>= 1;
        }
        return r;
    }
    M inv() const { return pow(MD - 2); }
    friend ostream& operator<<(ostream& os, const M& r) { return os << r.v; }
    friend istream& operator>>(istream& is, M& r) { return is >> r.v; }
};
using Mint = ModInt<MOD>;
template <typename T>
struct Compress {
    vector<T> xs;

    Compress() = default;

    Compress(const vector<T>& vs) {
        add(vs);
    }

    Compress(const initializer_list<vector<T>>& vs) {
        for (auto& p : vs)
            add(p);
    }

    void add(const vector<T>& vs) {
        copy(begin(vs), end(vs), back_inserter(xs));
    }

    void add(const T& x) {
        xs.emplace_back(x);
    }

    void build() {
        sort(begin(xs), end(xs));
        xs.erase(unique(begin(xs), end(xs)), end(xs));
    }

    vector<int> get(const vector<T>& vs) const {
        vector<int> ret;
        transform(begin(vs), end(vs), back_inserter(ret), [&](const T& x) {
            return lower_bound(begin(xs), end(xs), x) - begin(xs);
        });
        return ret;
    }

    int get(const T& x) const {
        return lower_bound(begin(xs), end(xs), x) - begin(xs);
    }

    const T& operator[](int k) const {
        return xs[k];
    }
};
const int MN = 1'000'000;
Mint fact[MN], iFac[MN];

void first() {
    fact[0] = Mint(1);
    for (int i = 1; i < MN; i++)
        fact[i] = fact[i - 1] * Mint(i);
    iFac[MN - 1] = fact[MN - 1].inv();
    for (int i = MN - 1; i >= 1; i--) {
        iFac[i - 1] = iFac[i] * Mint(i);
    }
    assert(fact[2345] * iFac[2345] == Mint(1));
}
Mint C(int n, int k) {
    if (n < k || k < 0)
        return Mint(0);
    return fact[n] * iFac[k] * iFac[n - k];
}

int N;
vector<int> A;
itn cnt[505050];
vector<int> SUM;

void solve() {
    first();
    SUM.resize(N + 1);
    cnt[0] = 1;
    FOR(i, N) {
        SUM[i + 1] = SUM[i] ^ A[i];
        cnt[i + 1] = cnt[i];
        if (SUM[i + 1] == 0)
            cnt[i + 1]++;
        cerr << SUM[i] << " ";
    }
    cerr << endl;
    Compress<int> z(SUM);
    z.build();
    //vector<pair<int, int>> V(z.size() + 1);
    vector<vector<int>> V(z.xs.size());
    FOR(N + 1) {
        V[z.get(SUM[i])].pb(i);
    }

    if (SUM[N] == 0) {
        Mint ans = 0;
        for (auto& v : V) {
            /*
         for (auto x : v) {
                cerr << x << " ";
            }
            cerr << endl;
            */
            if (v[0] == 0) {
                ans += Mint{2}.pow(cnt[N] - 2) - 1;
                //  cerr << ans << endl;
                continue;
            }
            Mint t0 = 1, t1 = 1;
            int pre = cnt[v[0]];
            for (itn i = 1; i < v.size(); i++) {
                int x = v[i];
                int cnt_0 = cnt[x] - pre;
                pre = cnt[x];
                Mint t1_tmp = t1;
                t1 += t1 * cnt_0;
                t1 += t0;
                t0 += t1_tmp * cnt_0;
                // cerr << x << " : " << cnt_0 << " " << t0 << " " << t1 << endl;
            }
            int cnt_0 = cnt[N] - pre;
            //cerr << cnt_0 << endl;
            //cerr << SUM[v[0]] << " : " << t1 << endl;
            ans += t1;
        }
        ans += 1;
        cout << ans << endl;
    } else {
        int num = SUM[N];
        Mint t0 = 1, t1 = 0;
        FOR(i, 1, N) {
            if (SUM[i] == 0) {
                t0 += t1;
            } else if (SUM[i] == num)
                t1 += t0;
        }
        cout << t0 << endl;
    }
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin >> N;
    A.resize(N);
    FOR(N)
    cin >> A[i];


    solve();
    return 0;
}


Measured memory_bytes: 40812