#include<bits/stdc++.h>
using namespace std;
using ll = long long;
//using LL = __int128
#define N 1000010
#define M 25
ll id, n, a[N], sum[N], cnt[M];
map<int, int> v;
int main() {
	scanf("%lld%lld", &id, &n);
	for(int i = 1 ; i <= n ; i++)
		scanf("%lld", a + i);
	ll maxn = 0;
	for(int i = 1 ; i <= n ; i++) {
		sum[i] = a[i] ^ sum[i - 1];
		maxn = max(maxn, sum[i]);
	}
	/*
	if(n <= 100){
		ll ans = 0;
		for(int i = 1 ; i <= n ; i++)
			for(int j = i ; j <= n ; j++){
				v.clear();
				for(int k = i ; k <= j ; k++)
					v[a[k]] ^= 1;
				ll cnt = 0;
				for(int l = i ; l <= j ; l++)
					if(v[a[l]])
						cnt ^= a[l], v[a[l]] = 0;
				ans += cnt;
			}
		printf("%lld", ans);
		exit(0);
	}
	if(n <= 2000){
		ll ans = 0;
		for(int i = 1 ; i <= n ; i++)
			for(int j = i ; j <= n ; j++)
				ans += sum[j] ^ sum[i - 1];
		printf("%lld", ans);
		exit(0);
	}
	//*/
	ll ans = 0;
	for(int i = 1 ; i <= n ; i++) {
		//cout << sum[i] << "\n";
		for(int j = 0 ; j <= __lg(maxn) ; j++) {
			if(sum[i] & (1ll << j))
				cnt[j]++;
		}
	}
	for(int j = 0 ; j <= __lg(maxn) ; j++) {
		ans += (1ll << j) * cnt[j] * (n + 1 - cnt[j]) ;
		//cout << j << " " << cnt[j] << "\n";
	}
	printf("%lld", ans);
	return 0;
}