import std.stdio, std.string, std.conv, std.range;
import std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, std.random, core.bitop;

enum inf = 1_001_001_001;
enum infl = 1_001_001_001_001_001_001L;



enum mod = 1_000_000_007L;

struct Mint {
    long x;

    this(long a) {
        x = a % mod;
        if (x < 0) x += mod;
    }

    this(Mint a) {
        x = a.x;
    }

    ref Mint opAssign(long a) {
        this = Mint(a);
        return this;
    }

    ref Mint opOpAssign(string op)(Mint rhs) {
        static if (op == "+") {
            x += rhs.x;
            if (x >= mod) x -= mod;
        }
        static if (op == "-") {
            x -= rhs.x;
            if (x < 0) x += mod;
        }
        static if (op == "*") {
            (x *= rhs.x) %= mod;
        }
        static if (op == "/") {
            this *= rhs.inv();
        }
        return this;
    }

    ref Mint opOpAssign(string op)(long rhs) {
        static if (op == "^^") {
            this = powmod(this, rhs);
            return this;
        }
        else {
            return mixin("this " ~ op ~ "= Mint(rhs)");
        }
    }

    const Mint powmod(Mint a, long b) {
        Mint res = 1, p = a;
        while (b > 0) {
            if (b & 1) res *= p;
            p *= p;
            b /= 2;
        }
        return res;
    }

    const Mint inv() {
        return powmod(this, mod - 2);
    }

    Mint opUnary(string op)() if (s == "-") {
        return Mint(-x);
    }

    Mint opBinary(string op, T)(const T rhs) {
        return mixin("Mint(this) " ~ op ~ "= rhs");
    }

    Mint opBinaryRight(string op)(const long rhs) {
        return mixin("Mint(rhs) " ~ op ~ "= this");
    }

    bool opEquals(Mint a, Mint b) {
        return a.x == b.x;
    }

    bool opEquals(long rhs) {
        long y = rhs % mod;
        if (y < 0) y += mod;
        return x == y;
    }

    string toString() {
        import std.conv : to;
        return x.to!string;
    }
}

unittest {
    long powmod(long a, long b) {
        return b > 0 ? powmod(a, b / 2)^^2 % mod * a^^(b & 1) % mod : 1L;
    }
    auto a = Mint(2), b = Mint(3);
    assert(a + b == 5);
    assert(a + 5 == 7);
    assert(1 + b == 4);
    assert(a - b == mod - 1);
    assert(a * b == 6);
    assert(a / b == 2 * powmod(3, mod - 2));
    assert(a^^10 == 1024);

    Mint z;
    assert(z == 0);

    (z += 2) *= 3;
    assert(z == 6);
}


void main() {
    int N;
    scan(N);
    auto a = readln.split.to!(int[]);

    debug {
        writeln("XOR: ", a.reduce!"a ^ b");
    }

    auto xs = new int[](N + 1);
    foreach (i ; 1 .. N + 1) {
        xs[i] = xs[i - 1] ^ a[i - 1];
    }

    Mint[int] dpb0, dpb1, dpz0, dpz1;
    int[int] laz;
    int cnt = 1;

    foreach (i ; 0 .. N + 1) {
        dpb0[xs[i]] = dpb1[xs[i]] = dpz1[xs[i]] = laz[xs[i]] = 0;
        dpz0[xs[i]] = 1;
    }

    dpb0.rehash;
    dpb1.rehash;
    dpz0.rehash;
    dpz1.rehash;
    laz.rehash;

    Mint ans;

    foreach (i ; 1 .. N + 1) {
        if (xs[i] > 0) {
            //if (!(xs[i] in laz)) {
            //    laz[xs[i]] = 0;
            //}

            int t = cnt - laz[xs[i]];

            //if (!(xs[i] in dpz0)) {
            //    dpz0[xs[i]] = 1;
            //    dpz1[xs[i]] = 0;
            //}
            //if (!(xs[i] in dpb0)) {
            //    dpb0[xs[i]] = 0;
            //    dpb1[xs[i]] = 0;
            //}

            dpz1[xs[i]] += dpb0[xs[i]] * t;
            dpz0[xs[i]] += dpb1[xs[i]] * t;
            laz[xs[i]] += t;

            if (i == N) {
                ans = dpz0[xs[i]];
            }

            dpb1[xs[i]] += dpz0[xs[i]];
            dpb0[xs[i]] += dpz1[xs[i]];
        }
        else {
            cnt++;
        }

        debug {
            writeln(dpb0);
            writeln(dpb1);
            writeln(dpz0);
            writeln(dpz1);
            writeln(cnt);
            writeln;
        }
    }

    if (xs[N] == 0) {
        debug {
            writeln(cnt);
            writeln(laz);
            writeln;
        }
        foreach (xi ; dpz0.byKey) {
            int t = cnt - laz[xi];

            dpz1[xi] += dpb0[xi] * t;
            dpz0[xi] += dpb1[xi] * t;

            //dpb1[xi] += dpz0[xi];
            //dpb0[xi] += dpz1[xi];

            ans += dpb1[xi];
        }

        ans += Mint(2)^^(xs.count(0).to!int - 2);
    }

    debug {
            writeln(dpb0);
            writeln(dpb1);
            writeln(dpz0);
            writeln(dpz1);
            writeln(cnt);
            writeln;
        }

    writeln(ans);
}



void scan(T...)(ref T args) {
    auto line = readln.split;
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront;
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}

bool chmin(T, U...)(ref T x, U args) {
    bool isChanged;
    foreach (arg; args) if (x > arg) {
        x = arg;
        isChanged = true;
    }
    return isChanged;
}

bool chmax(T, U...)(ref T x, U args) {
    bool isChanged;
    foreach (arg; args) if (x < arg) {
        x = arg;
        isChanged = true;
    }
    return isChanged;
}

void yes(bool ok, string y = "Yes", string n = "No") {
    return writeln(ok ? y : n);
}


Measured memory_bytes: 149192