import java.io.IOException;
import java.io.InputStream;
import java.util.InputMismatchException;

public class Main {

	public static void main(String[] args) {
		Task task = new Task();
		task.solve();
	}

	public static class Task {
		static final long MOD = (long) 1e9 + 7;

		private long modMul(long a, long b) {
			return (a * b) % MOD;
		}

		private long modAdd(long a, long b) {
			a += b;
			if (a >= MOD)
				a -= MOD;
			return a;
		}

		public void solve() {
			Scan sc = new Scan();
			int n = (int) sc.scanLong();
			int[][] arr = new int[n][64];
			for (int i = 0; i < n; ++i) {
				long num = sc.scanLong();
				for (int bit = 0; bit < 64; ++bit) {
					arr[i][bit] = (int) (num & 1);
					num >>= 1;
				}
			}

			for (int bit = 0; bit < 64; ++bit) {
				for (int i = 1; i < n; ++i) {
					arr[i][bit] += arr[i - 1][bit];
				}
			}

			long res = 0;

			for (int i = 0; i < n; ++i) {
				long pos = 1;
				for (int bit = 0; bit < 64; ++bit) {
					int curr_val = arr[i][bit] - (i > 0 ? arr[i - 1][bit] : 0);
					int rem = n - i - 1;
					int sum = arr[n - 1][bit] - arr[i][bit];
					if (curr_val == 1) {
						sum = rem - sum;
					}
					res = modAdd(res, modMul(sum, pos));
					pos = modMul(pos, 2);
				}
			}
			System.out.println(res);
		}

		private void disp(int[][] arr) {
			int n = arr.length;
			for (int i = 0; i < n; ++i) {
				for (int j = 0; j < 64; ++j)
					System.out.print(arr[i][j]);
				System.out.println();
			}
		}
	}

	public static class Scan {
		private byte[] buf = new byte[1024];
		private int index;
		private InputStream in;
		private int total;

		public Scan() {
			in = System.in;
		}

		public int scan() {
			if (total < 0)
				throw new InputMismatchException();
			if (index >= total) {
				index = 0;
				try {
					total = in.read(buf);
				} catch (IOException e) {
					throw new RuntimeException(e);
				}
				if (total <= 0)
					return -1;
			}
			return buf[index++];
		}

		public long scanLong() {
			long integer = 0;
			int n = scan();
			while (isWhiteSpace(n))
				n = scan();
			int neg = 1;
			if (n == '-') {
				neg = -1;
				n = scan();
			}
			while (!isWhiteSpace(n)) {
				if (n >= '0' && n <= '9') {
					integer *= 10;
					integer += n - '0';
					n = scan();
				} else
					throw new InputMismatchException();
			}
			return neg * integer;
		}

		public double scanDouble() throws IOException {
			double doub = 0;
			int n = scan();
			while (isWhiteSpace(n))
				n = scan();
			int neg = 1;
			if (n == '-') {
				neg = -1;
				n = scan();
			}
			while (!isWhiteSpace(n) && n != '.') {
				if (n >= '0' && n <= '9') {
					doub *= 10;
					doub += n - '0';
					n = scan();
				} else
					throw new InputMismatchException();
			}
			if (n == '.') {
				n = scan();
				double temp = 1;
				while (!isWhiteSpace(n)) {
					if (n >= '0' && n <= '9') {
						temp /= 10;
						doub += (n - '0') * temp;
						n = scan();
					} else
						throw new InputMismatchException();
				}
			}
			return doub * neg;
		}

		public String scanString() {
			StringBuilder sb = new StringBuilder();
			int n = scan();
			while (isWhiteSpace(n))
				n = scan();
			while (!isWhiteSpace(n)) {
				sb.append((char) n);
				n = scan();
			}
			return sb.toString();
		}

		public char scanChar() {
			int n = scan();
			while (isWhiteSpace(n))
				n = scan();
			return (char) n;
		}

		private boolean isWhiteSpace(int n) {
			if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1)
				return true;
			return false;
		}
	}
}


Measured memory_bytes: 145376