#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int mod = 1000000007;
ll up(ll x)
{
	return (x % mod + mod) % mod;
}
void solve()
{
	int n;
	cin >> n;
	vector<ll> a(n + 1, 0), s(n + 1, 0), ans(n + 1, 0);
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
		s[i] = s[i - 1] ^ a[i];
	}
	vector<array<ll, 2>> add(64);
	for (int i = 1; i <= n; i++) {
		for (ll j = 60; j >= 0; j--) {
			if (s[i] >> j & 1) {
				ans[i] += add[j][1];
			}
			else {
				ans[i] += add[j][0];
			}
		}
		ans[i] += s[i];
		// cout << ans[i] << endl;
		for (ll j = 0; j <= 60; j++) {
			ll res = (1ll << j) % mod;
			if (s[i] >> j & 1) {
				add[j][0] += ans[i] * res % mod;
				add[j][0] = up(add[j][0]);
			}
			else {
				add[j][1] += ans[i] * res % mod;
				add[j][1] = up(add[j][1]);
			}
		}
		/*for (int j = 0; j <= 3; j++) {
			cout << j << " " << add[j][0] << " " << add[j][1] << endl;
		}
		cout << i << " " << ans[i] << endl;*/
	}
	cout << ans[n] << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T = 1;
	while (T--)
		solve();
	return 0;
}