#include <bits/stdc++.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target( \
    "sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
using namespace std;
void itval(istream_iterator<string> it) {}
template <typename T, typename... Args>
void itval(istream_iterator<string> it, T a, Args... args) {
  cerr << *it << " = " << a << endl;
  itval(++it, args...);
}
const long long int MOD = 1e9 + 7;
template <typename T>
inline void print(T x) {
  cout << x << "\n";
}
template <typename T>
inline void printvec(T x) {
  for (auto a : x) cout << a << ' ';
  cout << '\n';
}
struct custom {
  bool operator()(
      const pair<pair<long long int, long long int>, long long int> &p1,
      const pair<pair<long long int, long long int>, long long int> &p2) const {
    if (p1.second == p2.second) {
      return p1.first.first > p2.first.first;
    }
    return p1.second < p2.second;
  }
};
long long int get_pow(long long int a, long long int b, long long int M = MOD) {
  long long int res = 1;
  while (b) {
    if (b & 1) res = (res * a) % M;
    a = (a * a) % M;
    b >>= 1;
  }
  return res;
}
const long long int N = 1e5 + 5, inf = 2e18;
vector<long long> divisors[N];
void solve() {
  for (long long int i = (long long int)1; i < (long long int)(N); i++) {
    for (int j = i; j < N; j += i) {
      divisors[j].push_back(i);
    }
  }
  int n;
  cin >> n;
  vector<long long> v(n);
  for (long long int i = (long long int)0; i < (long long int)(n); i++) {
    cin >> v[i];
  }
  sort(v.begin(), v.end());
  long long int ans = 0;
  for (long long int i = (long long int)1; i < (long long int)(100000 + 1);
       i++) {
    long long int m = divisors[i].size(), res = 1;
    for (int j = 0; j + 1 < m; j++) {
      auto it = lower_bound(v.begin(), v.end(), divisors[i][j + 1]) -
                lower_bound(v.begin(), v.end(), divisors[i][j]);
      res = res * get_pow(j + 1, it) % MOD;
    }
    auto it = v.end() - lower_bound(v.begin(), v.end(), divisors[i].back());
    if (it) {
      res = res * (get_pow(m, it) - get_pow(m - 1, it) + MOD) % MOD;
      ans += res;
      ans %= MOD;
    }
  }
  if (ans < 0) ans += MOD;
  cout << ans << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int test = 1;
  clock_t z = clock();
  for (long long int tes = (long long int)0; tes < (long long int)(test);
       tes++) {
    solve();
  }
  fprintf(stderr, "Total Time:%.4f\n", (double)(clock() - z) / CLOCKS_PER_SEC),
      fflush(stderr);
  return 0;
}
