Given are N positive integers A_1,...,A_N.

Consider positive integers B_1, ..., B_N that satisfy the following condition.

Condition: For any i, j such that 1 \leq i < j \leq N, A_i B_i = A_j B_j holds.

Find the minimum possible value of B_1 + ... + B_N for such B_1,...,B_N.

Since the answer can be enormous, print the sum modulo (10^9 +7).

Constraints

* 1 \leq N \leq 10^4
* 1 \leq A_i \leq 10^6
* All values in input are integers.

Input

Input is given from Standard Input in the following format:


N
A_1 ... A_N


Output

Print the minimum possible value of B_1 + ... + B_N for B_1,...,B_N that satisfy the condition, modulo (10^9 +7).

Examples

Input

3
2 3 4


Output

13


Input

5
12 12 12 12 12


Output

5


Input

3
1000000 999999 999998


Output

996989508
import java.util.*;
 
public class Main {
  public static long MOD = (long)Math.pow(10, 9) + 7;
  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();
    long[] a = new long[n];
    long[] count = new long[1000001];
    for(int i = 0; i < n; i++) {
      long t = sc.nextLong();
      a[i] = t;
      for(long j = 2; (j * j) <= t; j++) {
        long k = 0;
        while((t % j) == 0) {
          k++;
          t /= j;         
        }
        count[(int)j] = Math.max(count[(int)j], k);
      }
      if(t > 1) count[(int)t] = Math.max(count[(int)t], 1);
    }
 
    long ans = 0; 
 
    long lcm = 1;

    for(int i = 1; i < 1000001; i++) {
      long c = (long)Math.pow(i, count[i]);
      lcm = (lcm * c) % MOD;
    }
 
    for(int i = 0; i < n; i++) {
      long b = lcm;
      b = (b * func(a[i], MOD - 2)) % MOD;
      ans = (ans + b) % MOD;
    }
 
    System.out.println(ans);
  }

  public static long func(long a, long x) {
    if(x == 0) return 1;
    if((x % 2) == 0) {
      long t = func(a, x / 2);
      return (t * t) % MOD;
    } else {
      return (a * func(a, x - 1)) % MOD;
    }
  }
}