#include <bits/stdc++.h>
using namespace std;
using lint = long long int;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(0); ios::sync_with_stdio(false); cout << fixed << setprecision(20); }; } fast_ios_;
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template<typename T> istream &operator>>(istream &is, vector<T> &vec){ for (auto &v : vec) is >> v; return is; }
template<typename T> ostream &operator<<(ostream &os, const vector<T> &vec){ os << "["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const deque<T> &vec){ os << "deq["; for (auto v : vec) os << v << ","; os << "]"; return os; }
template<typename T> ostream &operator<<(ostream &os, const set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_set<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec){ os << "{"; for (auto v : vec) os << v << ","; os << "}"; return os; }
template<typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa){ os << "(" << pa.first << "," << pa.second << ")"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename TK, typename TV> ostream &operator<<(ostream &os, const unordered_map<TK, TV> &mp){ os << "{"; for (auto v : mp) os << v.first << "=>" << v.second << ","; os << "}"; return os; }
template<typename T> void ndarray(vector<T> &vec, int len) { vec.resize(len); }
template<typename T, typename... Args> void ndarray(vector<T> &vec, int len, Args... args) { vec.resize(len); for (auto &v : vec) ndarray(v, args...); }
template<typename T> bool mmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template<typename T> bool mmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
template<typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template<typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
#define dbg(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ") " << __FILE__ << endl;
#define FI first
#define SE second
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) ((lint)(x).size())
#define POW2(n) (1LL << (n))

constexpr lint MOD = 1000000007;
int N;
vector<int> A;

lint power(lint x, lint n, lint MOD)
{
    lint ans = 1;
    while (n>0)
    {
        if (n & 1) (ans *= x) %= MOD;
        (x *= x) %= MOD;
       n >>= 1;
    }
   return ans;
}

int main()
{
    cin >> N;
    A.resize(N);
    cin >> A;
    vector<int> rui(N + 1);
    REP(i, N) rui[i + 1] = (rui[i] xor A[i]);
    // dbg(rui);

    vector<int> zero_cnt(N + 1);
    REP(i, N) zero_cnt[i + 1] = zero_cnt[i] + (rui[i + 1] == 0);
    map<int, vector<int>> shown;
    REP(i, N) if (rui[i + 1]) shown[rui[i + 1]].push_back(i + 1);
    if (rui.back() == 0)
    {
        // 最後がゼロ 途中はなんでもよい
        // dbg(shown);
        lint ret = 0;
        for (auto &pa : shown)
        {
            vector<int> pos = pa.second;
            lint z = 1, o = 0;
            int now = 0;
            for (auto nxt : pos)
            {
                lint bet_zero = zero_cnt[nxt] - zero_cnt[now];
                lint z_nxt = (o * bet_zero + z) % MOD;
                lint o_nxt = (z_nxt + o) % MOD;
                z = z_nxt;
                o = o_nxt;
                now = nxt;
            }
            (ret += o) %= MOD;
        }
        // 全部ゼロの場合を足す
        (ret += power(2, zero_cnt[N] - 1, MOD)) %= MOD;

        cout << ret << endl;
        return 0;
    }
    else
    {
        int tgt = rui.back();
        lint z = 1, o = 0;
        FOR(i, 1, N)
        {
            if (rui[i] == 0)
            {
                (z += o) %= MOD;
            }
            else if (rui[i] == tgt)
            {
                (o += z) %= MOD;
            }
            // dbg(i);
            // dbg(z);
            // dbg(o);
        }
        cout << z << endl;
        return 0;
    }
}


Measured memory_bytes: 37504