#include <bits/stdc++.h>
using namespace std;
const int N = 1000019, mod = 1e9 + 7, M = 999999 + 1;
long long cnt[N], sum[N], sq[N];
long long dig[6], p10[6], p2[N];
long long g[N], ans[N];
void pre_process() {
  p10[0] = p2[0] = 1;
  for (int i = 1; i < 6; i++) p10[i] = 10 * p10[i - 1];
  for (int i = 1; i < N; i++) p2[i] = (1LL * p2[i - 1] * 2) % mod;
}
void upd(int a, int b, int z) {
  if (z == 1) {
    cnt[a] += cnt[b], cnt[a] %= mod;
    sum[a] += sum[b], sum[a] %= mod;
    sq[a] += sq[b], sq[a] %= mod;
    ans[a] += mod - g[b];
    ans[a] %= mod;
  } else {
    cnt[a] += mod - cnt[b], cnt[a] %= mod;
    sum[a] += mod - sum[b], sum[a] %= mod;
    sq[a] += mod - sq[b];
    sq[a] %= mod;
    ans[a] += g[b];
    ans[a] %= mod;
  }
  return;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  int n;
  cin >> n;
  for (int i = 0; i < n; i++) {
    int t;
    cin >> t;
    cnt[t]++;
  }
  pre_process();
  for (int x, i = M - 1; i >= 0; i--) {
    x = i;
    sum[i] = (1LL * i * cnt[i]) % mod;
    sq[i] = (1LL * i * i * cnt[i]) % mod;
    for (int c = 5; c >= 0; c--) {
      dig[c] = x % 10;
      x /= 10;
    }
    for (int mask = 1; mask < (1 << 6); mask++) {
      int vl = i, z = __builtin_popcount(mask);
      if (z % 2 == 1)
        z = +1;
      else
        z = -1;
      bool flg = true;
      for (int j = 0; j < 6; j++) {
        if (mask & (1 << j))
          if (dig[j] == 9) {
            flg = false;
            break;
          } else
            vl += p10[6 - j - 1];
      }
      if (flg == false) continue;
      upd(i, vl, z);
    }
    if (cnt[i] == 0) continue;
    if (cnt[i] >= 2) {
      int vl = (1LL * sum[i] * sum[i] + mod - sq[i]) % mod;
      g[i] += (1LL * vl * p2[cnt[i] - 2]) % mod, g[i] %= mod;
    }
    if (cnt[i] >= 1) {
      g[i] += (1LL * sq[i] * p2[cnt[i] - 1]) % mod;
      g[i] %= mod;
    }
    ans[i] += g[i], ans[i] %= mod;
  }
  long long v = 0;
  for (int i = 0; i < M; i++) {
    long long vl = 1LL * i * ans[i];
    v ^= vl;
  }
  cout << v << endl;
}
