import java.io.PrintStream;
import java.util.Scanner;

public class Main {
	public static void main(String[] args) throws Exception{
		new Main(new Scanner(System.in), System.out, System.err).exec();
	}
	public final Scanner sc;
	public final PrintStream out, err;
	public Main(final Scanner sc, final PrintStream out, final PrintStream err) {
		this.sc = sc;this.out = out;this.err = err;
	}
	static public final long pair(int a, int b) {return (((long)a) << 32) + b;}
	static public final int getPair1(long v) {return (int)(v >> 32);}
	static public final int getPari2(long v) {return (int)(v & 0xFFFFFFFF);}

	static public final long quad(long a, long b, long c, long d) {
		return ((a&0xFFFF)<< 48) + ((b&0xFFFF)<< 32) + ((c&0xFFFF)<< 16) +(d&0xFFFF);}
	static public final int getQuad1(long v) {return (int)( v >> 48          );}
	static public final int getQuad2(long v) {return (int)((v >> 32) & 0xFFFF);}
	static public final int getQuad3(long v) {return (int)((v >> 16) & 0xFFFF);}
	static public final int getQuad4(long v) {return (int)( v        & 0xFFFF);}

	static public final long record(int e, int m, int i) {
		return quad(-1, e, m, i);
	}
	static public final int re(long record) {
		return getQuad2(record);
	}
	static public final int rm(long record) {
		return getQuad3(record);
	}
	static public final int ri(long record) {
		return getQuad4(record);
	}

	//------------------------------------------

	private int p;
	private int[] inv;
	private int[] fact;
	private int[] finv;
	public final int mod(long v) {
		v %= p;
		return (int)(v < 0 ? v+p : v);
	}
	public final int mul(long a, long b) {
		return mod(a*b);
	}
	public final void initFact(double limit, double p) {
		initFact((int)limit, (int)p);
	}
	public final void initFact(int limit, int p) {
		this.p = p;
		this.inv = new int[limit+1];
		this.fact = new int[limit+1];
		this.finv = new int[limit+1];
		fact[1] = finv[1] = inv[0] = inv[1] = 1;
		for(int i=2;i<=limit;i++) {
			int a = p / i;
			int b = p % i;
			inv[i]  = mul(-a, inv[b]);
			fact[i] = mul(fact[i-1], i);
			finv[i] = mul(finv[i-1], inv[i]);
		}
	}
	public final int comb(int m, int n) {
		return mul(mul(fact[m], finv[n]), finv[m-n]);
	}

	//------------------------------------------


	public void exec() throws Exception{
		final int N = sc.nextInt();
		int[][] A = new int[N][60];
		int[] BITS = new int[60];
		for(int i=0;i<N;i++) {
			long a = sc.nextLong();
			for(int s=0;s<60;s++) {
				if(((a>>s)&0x1)==1) {
					A[i][s]=1;
					BITS[s]++;
				}
			}
		}
		long mod = 1000000000 + 7;
		long sum = 0;
		long[] val = new long[60];
		for(int i=0;i<60;i++) {
			val[i] = (0x1L<<i)%mod;
		}
		int right = N;
		for(int i=0;i<N-1;i++) {
			right--;
			for(int b=0;b<60;b++) {
				// 起点分の情報を削る。
				BITS[b]-=A[i][b];
				if(A[i][b]==1) {
					// 自身が1を持つ場合、0の数だけ加算される。
					sum = (sum + (right-BITS[b])*val[b]) %mod;
				}else {
					// 自身が0の場合、1の数だけ加算される。
					sum = (sum + (BITS[b]      )*val[b]) %mod;
				}
			}
		}
		out.println(sum);
	}
}
