#include <bits/stdc++.h>
using namespace std;
const int MOD = 10007;
const int MAXN = 100010;
int n, a[MAXN], ans;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%d", &a[i]);
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; i++)
    ans = (ans + (long long)a[i] * a[n + 1 - i] % MOD) % MOD;
  printf("%d\n", ans);
  return 0;
}
