Problem:
Score : 500 points

Problem Statement

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).

Sample Input 1

3
2 3 4

Sample Output 1

13

Let B_1=6, B_2=4, and B_3=3, and the condition will be satisfied.

Sample Input 2

5
12 12 12 12 12

Sample Output 2

5

We can let all B_i be 1.

Sample Input 3

3
1000000 999999 999998

Sample Output 3

996989508

Print the sum modulo (10^9+7).

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Time Limit Exceeded)

import java.util.*;
import java.io.*;

public class Main {
    static final int MOD = 1000000007;
	public static void main (String[] args) throws Exception {
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		int n = Integer.parseInt(br.readLine());
		String[] line = br.readLine().split(" ", n);
		ArrayList<HashMap<Integer, Integer>> maps = new ArrayList<>();
		HashMap<Integer, Integer> all = new HashMap<>();
		for (int i = 0; i < n; i++) {
		    maps.add(getMap(Integer.parseInt(line[i])));
		    for (Map.Entry<Integer, Integer> entry : maps.get(i).entrySet()) {
		        if (!all.containsKey(entry.getKey()) || all.get(entry.getKey()) < entry.getValue()) {
		            all.put(entry.getKey(), entry.getValue());
		        }
		    }
		}
		long ans = 0;
		for (HashMap<Integer, Integer> each : maps) {
		    ans += getLong(each, all);
		    ans %= MOD;
		}
		System.out.println(ans);
	}
	
	static HashMap<Integer, Integer> getMap(int x) {
	    HashMap<Integer, Integer> map = new HashMap<>();
	    for (int i = 2; i <= Math.sqrt(x); i++) {
	        while (x % i == 0) {
	            if (map.containsKey(i)) {
	                map.put(i, map.get(i) + 1);
	            } else {
	                map.put(i, 1);
	            }
	            x /= i;
	        }
	    }
	    if (x > 1) {
	        if (map.containsKey(x)) {
	            map.put(x, map.get(x) + 1);
	        } else {
	            map.put(x, 1);
	        }
	    }
	    return map;
	}
	
	static long getLong(HashMap<Integer, Integer> each, HashMap<Integer, Integer> all) {
	    long ans = 1;
	    for (Map.Entry<Integer, Integer> entry : all.entrySet()) {
	        if (each.containsKey(entry.getKey())) {
	            ans *= pow(entry.getKey(), entry.getValue() - each.get(entry.getKey()));
	        } else {
	            ans *= pow(entry.getKey(), entry.getValue());
	        }
	        ans %= MOD;
	    }
	    return ans;
	}
	
	static long pow(long x, long p) {
	    if (p == 0) {
	        return 1;
	    } else if (p % 2 == 0) {
	        return pow(x * x % MOD, p / 2);
	    } else {
	        return pow(x, p - 1) * x % MOD;
	    }
	}
}