local mfl, mce = math.floor, math.ceil
local bls, brs = bit.lshift, bit.rshift
local bor, band = bit.bor, bit.band
local bxor = bit.bxor
local TFDP = {}

TFDP.initialize = function(self, lim)
  self.lim = lim
  self.sz = 30
  self.way = true
  self.bcnt = mce((lim + 1) / self.sz)
  self.b1, self.b2 = {1}, {}
  for i = 2, self.bcnt do
    self.b1[i] = 0
    self.b2[i] = 0
  end
  self.curmax = 0
end

TFDP.add = function(self, v, cursum)
  local src = self.way and self.b1 or self.b2
  local dst = self.way and self.b2 or self.b1
  self.way = not self.way
  local bcnt = self.bcnt
  local bc2 = mce((cursum + 1) / self.sz)
  for i = 1, bc2 do
    dst[i] = src[i]
  end
  local sz = self.sz
  local jump, rem = mfl(v / sz), v % sz
  local denom, mul = bls(1, sz - rem), bls(1, rem)
  for i = 1, bcnt - jump do
    if bc2 < i then break end
    local v1 = src[i] % denom
    dst[i + jump] = bxor(dst[i + jump], v1 * mul)
  end
  for i = 1, bcnt - jump - 1 do
    if bc2 < i then break end
    local v2 = brs(src[i], sz - rem)
    dst[i + jump + 1] = bxor(dst[i + jump + 1], v2)
  end
end

TFDP.query = function(self, x)
  local group = mfl(x / self.sz) + 1
  local idx = x - (group - 1) * self.sz
  local tbl = self.way and self.b1 or self.b2
  return band(tbl[group], bls(1, idx)) ~= 0
end

local tf = TFDP
local n = io.read("*n")
local asum = 0
local a = {}
for i = 1, n do
  a[i] = io.read("*n")
  asum = asum + a[i]
end
tf:initialize(asum)
local cursum = 0
for i = 1, n do
  local ai = a[i]
  tf:add(ai, cursum)
  cursum = cursum + ai
end
-- print(os.clock())
local ret = 0
for i = 1, asum do
  if tf:query(i) then
    ret = bxor(ret, i)
  end
end
print(ret)
-- print(os.clock())