import std.stdio, std.conv, std.array, std.string, std.algorithm, std.container, std.range, core.stdc.stdlib, std.math, std.typecons;
T[][] combinations(T)(T[] s, in int m) {   if (!m) return [[]];   if (s.empty) return [];   return s[1 .. $].combinations(m - 1).map!(x => s[0] ~ x).array ~ s[1 .. $].combinations(m); }

void main() {
  auto N = readln.chomp.to!int;
  auto A = readln.split.to!(long[]);

  void solve() {
    long sum;
    foreach(i; 0..N-1) {
      foreach(j; i..N) {
        sum += A[i] ^ A[j];
        sum %= 1000000007;
      }
    }

    writeln(sum);
  }

  solve();
}
