#include <bits/stdc++.h>
using namespace std;
template <typename T>
T in() {
  char ch;
  T n = 0;
  bool ng = false;
  while (1) {
    ch = getchar();
    if (ch == '-') {
      ng = true;
      ch = getchar();
      break;
    }
    if (ch >= '0' && ch <= '9') break;
  }
  while (1) {
    n = n * 10 + (ch - '0');
    ch = getchar();
    if (ch < '0' || ch > '9') break;
  }
  return (ng ? -n : n);
}
template <typename T>
inline T Dist(T x1, T y1, T x2, T y2) {
  return sqrt((x1 - x2 * x1 - x2) + (y1 - y2 * y1 - y2));
}
template <typename T>
inline T POW(T B, T P) {
  if (P == 0) return 1;
  if (P & 1)
    return B * POW(B, P - 1);
  else
    return (POW(B, P / 2) * POW(B, P / 2));
}
template <typename T>
inline T ABS(T a) {
  if (a < 0)
    return -a;
  else
    return a;
}
template <typename T>
inline T Gcd(T a, T b) {
  if (a < 0) return Gcd(-a, b);
  if (b < 0) return Gcd(a, -b);
  return (b == 0) ? a : Gcd(b, a % b);
}
template <typename T>
inline T Lcm(T a, T b) {
  if (a < 0) return Lcm(-a, b);
  if (b < 0) return Lcm(a, -b);
  return a * (b / Gcd(a, b));
}
long long Bigmod(long long base, long long power, long long MOD) {
  long long ret = 1;
  while (power) {
    if (power & 1) ret = (ret * base) % MOD;
    base = (base * base) % MOD;
    power >>= 1;
  }
  return ret;
}
long long ModInverse(long long number, long long MOD) {
  return Bigmod(number, MOD - 2, MOD);
}
int Set(int N, int pos) { return N = N | (1 << pos); }
int Reset(int N, int pos) { return N = N & ~(1 << pos); }
bool Chkbit(int N, int pos) { return (bool)(N & (1 << pos)); }
bool isVowel(char ch) {
  ch = toupper(ch);
  if (ch == 'A' || ch == 'U' || ch == 'I' || ch == 'O' || ch == 'E')
    return true;
  return false;
}
bool isConst(char ch) {
  if (isalpha(ch) && !isVowel(ch)) return true;
  return false;
}
int toInt(string s) {
  int sm;
  stringstream ss(s);
  ss >> sm;
  return sm;
}
long long int toLlint(string s) {
  long long int sm;
  stringstream ss(s);
  ss >> sm;
  return sm;
}
int ar[1006], Ln;
void Divisors(int n) {
  Ln = 0;
  int sq = sqrt(n);
  for (int i = 1; i <= sq; i++) {
    if (n % i == 0) {
      ar[Ln++] = i;
      if (i != n / i) {
        ar[Ln++] = n / i;
      }
    }
  }
  sort(ar, ar + Ln);
}
int dp[200007];
long long int Solve(int l) {
  if (l == 0) return 0;
  long long int ans = 1;
  ar[l] = 100001;
  for (int i = 0; i < l; i++) {
    int cnt = dp[ar[i + 1] - 1] - dp[ar[i] - 1];
    ans = (ans * Bigmod((i + 1), cnt, 1000000007)) % 1000000007;
  }
  return ans;
}
int main() {
  int n;
  n = in<int>();
  for (int i = 0; i < n; i++) {
    int x;
    x = in<int>();
    dp[x]++;
  }
  for (int i = 1; i <= 100001; i++) {
    dp[i] += dp[i - 1];
  }
  long long int ans = 0;
  for (int i = 1; i <= 100000; i++) {
    Divisors(i);
    ans = (ans + Solve(Ln)) % 1000000007;
    ans = (ans - Solve(Ln - 1) + 1000000007) % 1000000007;
  }
  printf("%lld\n", ans);
  return 0;
}
