{-# LANGUAGE OverloadedStrings #-}
module Main where

import           Data.List
import           Control.Monad
import           Debug.Trace
import qualified Data.ByteString.Char8         as BC
import           Data.Maybe                     ( fromJust )
import qualified Data.Set                      as S
import qualified Data.IntMap.Strict            as IM
import qualified Data.Map.Strict               as M
import           Data.Char
import Data.Bits


readTuple2 :: IO (Int, Int)
readTuple2 = do
    [a, b] <- map (fst . fromJust . BC.readInt) . BC.words <$> BC.getLine
    return (a, b)

readTuple3 :: IO (Int, Int, Int)
readTuple3 = do
    [a, b, c] <- map (fst . fromJust . BC.readInt) . BC.words <$> BC.getLine
    return (a, b, c)

readInt :: IO Int
readInt = fst . fromJust . BC.readInt <$> BC.getLine

readInts :: IO [Int]
readInts = map (fst . fromJust . BC.readInt) . BC.words <$> BC.getLine

split :: (a -> Bool) -> [a] -> [[a]]
split f [] = []
split f as =
    let (fo, la) = span f as
        las      = case la of
            [] -> []
            xs -> split f $ tail xs
    in  case fo of
            [] -> las
            xs -> xs : las

solve :: Int -> [Int] -> Int
solve n as = 
    let 
        amap = IM.fromList $ zip [1..] as
        findRight total right
            | right > n = (total, right)
            | newTotal /= newXor = (total, right)
            | otherwise = findRight newTotal $ right + 1
            where
                newVal = amap IM.! right
                newTotal = total + newVal
                newXor = total `xor` newVal

        go (right, total, ans) left =
            let
                (newTotal, newRight) = findRight total right
                newNum = newRight - left
            in
                (newRight, newTotal - amap IM.! left, ans + newNum)
        (_, _, ans) = foldl' go (1, 0, 0) [1..n]
    in 
    ans


main = do
    n <- readInt
    as <- readInts
    print $ solve n as


