Problem: You are given n integers a1, a2, ..., an. Denote this list of integers as T.

Let f(L) be a function that takes in a non-empty list of integers L.

The function will output another integer as follows: 

  * First, all integers in L are padded with leading zeros so they are all the same length as the maximum length number in L. 
  * We will construct a string where the i-th character is the minimum of the i-th character in padded input numbers. 
  * The output is the number representing the string interpreted in base 10. 



For example f(10, 9) = 0, f(123, 321) = 121, f(530, 932, 81) = 30.

Define the function 

<image> Here, <image> denotes a subsequence.

In other words, G(x) is the sum of squares of sum of elements of nonempty subsequences of T that evaluate to x when plugged into f modulo 1 000 000 007, then multiplied by x. The last multiplication is not modded. 

You would like to compute G(0), G(1), ..., G(999 999). To reduce the output size, print the value <image>, where <image> denotes the bitwise XOR operator.

Input

The first line contains the integer n (1 ≤ n ≤ 1 000 000) — the size of list T.

The next line contains n space-separated integers, a1, a2, ..., an (0 ≤ ai ≤ 999 999) — the elements of the list. 

Output

Output a single integer, the answer to the problem.

Examples

Input

3
123 321 555


Output

292711924


Input

1
999999


Output

997992010006992


Input

10
1 1 1 1 1 1 1 1 1 1


Output

28160

Note

For the first sample, the nonzero values of G are G(121) = 144 611 577, G(123) = 58 401 999, G(321) = 279 403 857, G(555) = 170 953 875. The bitwise XOR of these numbers is equal to 292 711 924.

For example, <image>, since the subsequences [123] and [123, 555] evaluate to 123 when plugged into f.

For the second sample, we have <image>

For the last sample, we have <image>, where <image> is the binomial coefficient.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#pragma GCC optimize(3)
const int maxn = 999999, mod = 1000000007;
int n, bit[maxn + 10];
long long num[maxn + 10], sum[maxn + 10], sqsum[maxn + 10], power[maxn + 10],
    ans[maxn + 10];
long long tot;
int main() {
  power[0] = 1;
  for (int i = 1; i <= maxn; ++i) power[i] = power[i - 1] * 2 % mod;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) {
    int x;
    scanf("%d", &x);
    ++num[x];
    sum[x] += x;
    (sqsum[x] += 1ll * x * x % mod) %= mod;
  }
  for (int i = maxn; i >= 0; --i) {
    for (int j = 0, t = i; j < 6; ++j) bit[j] = t % 10, t /= 10;
    for (int j = 1; j < 1 << 6; ++j) {
      int tot = 0, d = -1;
      bool suc = 1;
      for (int k = 5; k >= 0; --k)
        if (j >> k & 1) {
          if (bit[k] == 9) {
            suc = 0;
            break;
          } else
            d = -d, tot = tot * 10 + bit[k] + 1;
        } else
          tot = tot * 10 + bit[k];
      if (suc) {
        num[i] += d * num[tot];
        sum[i] += d * sum[tot];
        sqsum[i] += d * sqsum[tot];
      }
    }
  }
  for (int i = 0; i <= maxn; ++i) {
    num[i] %= mod;
    sum[i] %= mod;
    sqsum[i] %= mod;
    if (num[i] >= 1) (ans[i] += sqsum[i] * power[num[i] - 1] % mod) %= mod;
    if (num[i] >= 2)
      (ans[i] += (sum[i] * sum[i] % mod - sqsum[i] + mod) % mod *
                 power[num[i] - 2] % mod) %= mod;
  }
  for (int i = 0; i <= maxn; ++i) {
    for (int j = 0, t = i; j < 6; ++j) bit[j] = t % 10, t /= 10;
    for (int j = 1; j < 1 << 6; ++j) {
      int tot = 0, d = 1;
      bool suc = 1;
      for (int k = 5; k >= 0; --k)
        if (j >> k & 1) {
          if (bit[k] == 9) {
            suc = 0;
            break;
          } else
            d = -d, tot = tot * 10 + bit[k] + 1;
        } else
          tot = tot * 10 + bit[k];
      if (suc) {
        (ans[i] += d * ans[tot]) %= mod;
        if (ans[i] < 0) ans[i] += mod;
      }
    }
    tot ^= i * ans[i];
  }
  printf("%lld", tot);
}