def main():
    import sys
    sys.setrecursionlimit(1 << 25)
    n, *rest = map(int, sys.stdin.read().split())
    a = rest[:n]
    
    from collections import deque

    existing = set(a)
    queue = deque(a)
    seen = set(a)
    
    while queue:
        u = queue.popleft()
        for v in a:
            if u != v:
                candidates = [u & v, u | v, u ^ v]
                for c in candidates:
                    if c not in seen:
                        seen.add(c)
                        queue.append(c)
    
    print(len(seen))

if __name__ == "__main__":
    main()