from collections import deque
N=int(input())
A=sorted(map(int,input().split()))
N=len(A)
V=N+2
G=[[] for i in range(V)]
L=[0]*V
I=[0]*V
INF=10**15
def ae(fr,to,ca):
  global G
  G[fr].append([to,ca,len(G[to]),0])
  G[to].append([fr,0,len(G[fr])-1,0])

def bfs(s):
  global INF,L,V,G
  L=[-1]*V
  Q=deque()
  L[s]=0
  Q.append(s)
  while(len(Q)):
    x=Q.popleft()
    for i in range(len(G[x])):
      if G[x][i][1]>0 and L[G[x][i][0]]<0:
        L[G[x][i][0]]=L[x]+1
        Q.append(G[x][i][0]) 

def dfs(v,t,f):
  global I,G,V
  if v==t:
    return f
  for i in range(I[v],len(G[v])):
    if G[v][i][1]>0 and L[v]<L[G[v][i][0]]:
      d=dfs(G[v][i][0],t,min(f,G[v][i][1]))
      if d>0:
        G[v][i][1]-=d
        G[v][i][3]+=d
        G[G[v][i][0]][G[v][i][2]][1]+=d
        G[G[v][i][0]][G[v][i][2]][3]-=d
        return d
    I[v]+=1
  return 0

def mf(s,t):
  global L,I,INF,V
  fl=0
  while(True):
    bfs(s)
    if L[t]<0:
      break
    I=[0]*V
    f=0
    while(True):
      f=dfs(s,t,INF)
      if f<=0:
        break
      fl+=f
  return fl

D=dict()
BB=set([1<<i for i in range(31)])
for i in range(N):
  f=0
  if bin(A[i]).count('1')&1:
    ae(i,V-1,1)
    f=1
  else:
    ae(V-2,i,1)
  D[A[i]]=i
  for j in range(i):
    if A[i]^A[j] in BB:
      if f:
        ae(j,i,1)
      else:
        ae(i,j,1)
print(N-mf(V-2,V-1))