#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, const U &b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, const U &b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T1, class T2>
inline void gn(T1 &x1, T2 &x2) {
  gn(x1), gn(x2);
}
template <class T1, class T2, class T3>
inline void gn(T1 &x1, T2 &x2, T3 &x3) {
  gn(x1, x2), gn(x3);
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T1, class T2>
inline void print(T1 x1, T2 x2) {
  printsp(x1), println(x2);
}
template <class T1, class T2, class T3>
inline void print(T1 x1, T2 x2, T3 x3) {
  printsp(x1), printsp(x2), println(x3);
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = (long long)a * a % m)
    if (b & 1) ans = (long long)ans * a % m;
  return ans;
}
int a[100010], p[100010];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%d", &a[i]);
  sort(a, a + n);
  int ans = 0;
  for (int d = 1; d < 100010; d++) {
    int k = 0;
    int r = 0;
    for (int j = 1; j * j <= d; j++) {
      if (d % j != 0) continue;
      if (j * j == d)
        k += 1;
      else
        k += 2;
    }
    for (int j = 1; j * j <= d; j++) {
      if (d % j != 0) continue;
      p[++r] = j;
      p[k + 1 - r] = d / j;
    }
    int res = 1;
    int m = lower_bound(a, a + n, d) - a;
    if (m >= n) continue;
    for (int i = 1; i <= k; i++) {
      int ed = lower_bound(a, a + n, p[i]) - a;
      int st = lower_bound(a, a + n, p[i - 1]) - a;
      res = (long long)res * power(i - 1, ed - st, 1000000007) % 1000000007;
    }
    res = (long long)res *
          ((1000000007 +
            (power(k, n - m, 1000000007) - power(k - 1, n - m, 1000000007)) %
                1000000007) %
           1000000007) %
          1000000007;
    ans = (ans + res) % 1000000007;
  }
  printf("%d\n", ans);
  return 0;
}
