program xor_partitioning
  implicit none
  integer(8), parameter :: md = 1000000007_8
  integer, parameter :: p = 1048575
  integer :: n, a(500000) = 0, x(0:500000) = 0, m, i, k
  integer(8) :: ans = 0_8, dp0(0:p) = 1_8, dpx(0:p) = 0_8, dpz(0:p) = 0_8
  integer(8) :: prev0, prevx, next0, nextx
  read(*,*) n
  read(*,*) a(1:n)
  do i = 1, n
    x(i) = xor(x(i-1),a(i))
  end do
  if (x(n) == 0) then
    m = 1
    do i = 0, n-1
      if (x(i) == 0) then
        m = m+1
        cycle
      end if
      k = m-dpz(x(i))
      dp0(x(i)) = mod(dp0(x(i))+int(k,8)*dpx(x(i)),md)
      dpx(x(i)) = mod(dpx(x(i))+dp0(x(i)),md)
      dpz(x(i)) = int(m,8)
    end do
    ans = pow(2_8,m-2)
    do i = 0, p
      ans = mod(ans+dpx(i),md)
    end do
    write(*,'(i0)') ans
    stop
  end if
  prev0 = 1_8
  prevx = 0_8
  do i = 1, n
    next0 = prev0
    nextx = prevx
    if (x(i) == 0) next0 = mod(prev0+prevx,md)
    if (x(i) == x(n)) nextx = mod(prev0+prevx,md)
    prev0 = next0
    prevx = nextx
  end do
  write(*,'(i0)') prev0
contains
  integer(8) function pow(x,n)
    integer(8), intent(in) :: x
    integer, intent(in) :: n
    integer :: m
    integer(8) :: p
    pow = 1_8
    p = x
    m = n
    do while (m > 0)
      if (btest(m,0)) pow = mod(pow*p,md)
      p = mod(p*p,md)
      m = rshift(m,1)
    end do
  end
end program xor_partitioning