#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  char c = getchar();
  long long x = 0;
  bool f = 0;
  for (; !isdigit(c); c = getchar()) f ^= !(c ^ 45);
  for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
  if (f) x = -x;
  return x;
}
struct modint {
  long long x;
  modint(long long o = 0) { x = o; }
  modint &operator=(long long o) { return x = o, *this; }
  modint &operator+=(modint o) {
    return x = x + o.x >= 1000000007 ? x + o.x - 1000000007 : x + o.x, *this;
  }
  modint &operator-=(modint o) {
    return x = x - o.x < 0 ? x - o.x + 1000000007 : x - o.x, *this;
  }
  modint &operator*=(modint o) { return x = 1ll * x * o.x % 1000000007, *this; }
  modint &operator^=(long long b) {
    modint a = *this, c = 1;
    for (; b; b >>= 1, a *= a)
      if (b & 1) c *= a;
    return x = c.x, *this;
  }
  modint &operator/=(modint o) { return *this *= o ^= 1000000007 - 2; }
  modint &operator+=(long long o) {
    return x = x + o >= 1000000007 ? x + o - 1000000007 : x + o, *this;
  }
  modint &operator-=(long long o) {
    return x = x - o < 0 ? x - o + 1000000007 : x - o, *this;
  }
  modint &operator*=(long long o) {
    return x = 1ll * x * o % 1000000007, *this;
  }
  modint &operator/=(long long o) {
    return *this *= ((modint(o)) ^= 1000000007 - 2);
  }
  template <class I>
  friend modint operator+(modint a, I b) {
    return a += b;
  }
  template <class I>
  friend modint operator-(modint a, I b) {
    return a -= b;
  }
  template <class I>
  friend modint operator*(modint a, I b) {
    return a *= b;
  }
  template <class I>
  friend modint operator/(modint a, I b) {
    return a /= b;
  }
  friend modint operator^(modint a, long long b) { return a ^= b; }
  friend bool operator==(modint a, long long b) { return a.x == b; }
  friend bool operator!=(modint a, long long b) { return a.x != b; }
  bool operator!() { return !x; }
  modint operator-() { return x ? 1000000007 - x : 0; }
};
long long n;
modint pw2[1000005], f[1000005][3], g[1000005];
long long pw10[10] = {1, 10, 100, 1000, 10000, 100000, 1000000};
signed main() {
  n = read();
  pw2[0] = 1;
  for (register long long i = (1); i <= (1000000); ++i) pw2[i] = pw2[i - 1] * 2;
  for (register long long i = (1); i <= (n); ++i) {
    long long x = read();
    f[x][0] += 1;
    f[x][1] += x;
    f[x][2] += modint(x) * x;
  }
  for (register long long j = (0); j <= (5); ++j)
    for (register long long i = (999999); i >= (1); --i)
      if (i / pw10[j] % 10 != 9)
        for (register long long k = (0); k <= (2); ++k)
          f[i][k] += f[i + pw10[j]][k];
  for (register long long i = (0); i <= (999999); ++i) {
    if (f[i][0].x >= 1) g[i] += f[i][2] * pw2[f[i][0].x - 1];
    if (f[i][0].x >= 2)
      g[i] += (f[i][1] * f[i][1] - f[i][2]) * pw2[f[i][0].x - 2];
  }
  for (register long long j = (0); j <= (5); ++j)
    for (register long long i = (0); i <= (999999); ++i)
      if (i / pw10[j] % 10 != 9) g[i] -= g[i + pw10[j]];
  long long res = 0;
  for (register long long i = (0); i <= (999999); ++i) res ^= 1ll * i * g[i].x;
  cout << res;
  return 0;
}
