import java.util.ArrayList;
import java.util.Arrays;
import java.util.HashSet;
import java.util.LinkedList;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;

public class Main {
	
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		
		final int N = sc.nextInt();
		
		boolean[] DP = new boolean[(1 << (14 + 1)) + 1];
		DP[0] = true;
		for(int i = 0; i < N; i++){
			final int A = sc.nextInt();
			
			for(int j = 0; j < DP.length; j++){
				if(DP[j]){
					DP[j ^ A] = true;
				}
			}
		}
		
		int count = 0;
		for(int i = 0; i < DP.length; i++){
			count += DP[i] ? 1 : 0;
		}
		
		System.out.println(count);
	}
	
}