func_code_string: #include <bits/stdc++.h>   using namespace std;   template <typename T>   void UpdateMax(T& a, T b) {     if (a < b) a = b;   }   template <typename T>   void UpdateMin(T& a, T b) {     if (a > b) a = b;   }   template <typename T>   inline void read(T& x) {     x = 0;     char c = getchar();     int flag = 1;     while (!isdigit(c)) {       if (c ==  - ) flag = -1;       c = getchar();     }     while (isdigit(c)) {       x = x * 10 + c -  0 ;       c = getchar();     }     x *= flag;   }   template <typename T>   void Unique(vector<T>& vec) {     sort(vec.begin(), vec.end());     vec.erase(unique(vec.begin(), vec.end()), vec.end());   }   template <typename T>   void Relabel(vector<T>& vec, T& value) {     value = lower_bound(vec.begin(), vec.end(), value) - vec.begin() + 1;   }   template <typename T, typename V>   void Print(const pair<T, V>& x) {     cout << x.first <<   @   << x.second <<   |  ;   }   template <typename T>   void Print(const T& x) {     cout << x <<    ;   }   template <typename T>   void Pcon(const T& x) {     cout <<   nsize:   << x.size() << endl;     for (const auto& item : x) Print(item);   }   std::vector<int> LABS;   template <typename T>   void Print(const T* x, int offset, int loop) {     for (int i = 0; i <= loop; i++) {       cout <<  [ ;       for (int item : LABS) cout << item - offset <<  , ;       cout << i - offset <<  ]: ;       cout << x[i] <<    ;     }   }   template <typename T, typename... Args>   void Print(const T* f, int offset, int loop, Args... args) {     for (int i = 0; i <= loop; i++) {       LABS.push_back(i);       Print(f[i], offset, args...);       cout << endl;       LABS.pop_back();     }   }   template <typename T, typename V>   bool Has(T& cluster, const V& item) {     return cluster.find(item) != cluster.end();   }   int Logn(long long x) {     int cnt = 0;     while (x) {       ++cnt;       x >>= 1;     }     return cnt;   }   const int MOD = 1e9 + 7;   const int N = 2e5 + 5;   const int dir[4][2] = {{-1, 0}, {0, -1}, {1, 0}, {1, 0}};   struct Edg {     int x, y, z;     friend bool operator<(const Edg& lhs, const Edg& rhs) {       return lhs.z < rhs.z;     }   } edg[N];   bool vis[N], used[N];   clock_t start_time;   int t, n, m;   int f[N], a[N];   vector<int> G[N];   inline void SetClock() { start_time = clock(); }   bool TimeOut(size_t ms) {     if (1000 * (clock() - start_time) >= ms * ((clock_t)1000)) return true;     return false;   }   inline pair<int, int> DeSerialize(int c) { return {(c) / m, (c) % m}; }   template <typename T, typename V>   inline void Add(T& v, const V& delta) {     v += delta;     if (v >= MOD) v -= MOD;   }   template <typename T, typename V>   inline void Dec(T& v, const V& delta) {     v -= delta;     if (v < 0) v += MOD;   }   long long ksm(long long a, long long b) {     long long cnt = 1;     while (b) {       if (b & 1) cnt = cnt * a % MOD;       b >>= 1;       a = a * a % MOD;     }     return cnt;   }   int main() {     srand(time(0));     SetClock();     cin.sync_with_stdio(false);     cin >> n;     for (int(i) = 1; (i) <= (n); ++(i)) {       cin >> a[i];       ++f[a[i]];     }     for (int(i) = 1; (i) <= (100000); ++(i)) {       f[i] += f[i - 1];     }     long long ans = 0;     for (int p = 100000; p >= 1; --p) {       vector<int> facs;       for (int i = 1; i * i <= p; ++i) {         if (p % i == 0) {           facs.emplace_back(i);           if (i * i != p) {             facs.emplace_back(p / i);           }         }       }       sort(facs.begin(), facs.end());       long long tmp = 1, tmp2 = 1;       for (size_t i = 0; i < facs.size(); ++i) {         long long t = i == facs.size() - 1 ? n - f[facs[i] - 1]                                            : f[facs[i + 1] - 1] - f[facs[i] - 1];         if (i == facs.size() - 1) {           tmp2 = (tmp * ksm(i, t)) % MOD;         }         tmp = (tmp * ksm(i + 1, t)) % MOD;       }       Dec(tmp, tmp2);       Add(ans, tmp);     }     cout << ans << endl;   }   