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.util.stream.Collectors;
import java.util.stream.IntStream;
import java.util.stream.LongStream;


public class Main {
    public static final long MOD = 1000000007;

    public static long pow(long a, long n){
        if(n == 0){return 1L;}
        if(n == 1){return a;}
        long res = n/2;
        long rem = n%2;
        long p = pow(a, res) % MOD;
        return (p*p*pow(a, rem)) % MOD;
    }
    public static List<Long> sosuu = new ArrayList<>();

    public static void main(String[] args) {
        sosuu = LongStream.rangeClosed(2, 1000000)
                .filter(i -> IntStream.rangeClosed(2, (int)Math.sqrt(i))
                        .allMatch(j -> i%j !=0)).boxed().collect(Collectors.toList());
        Scanner sc = new Scanner(System.in);
        // 整数の入力
        int N = sc.nextInt();
        List<SoInsu> llist = new ArrayList<>(N);
        for(int i=0;i<N;i++){
            llist.add(new SoInsu(sc.nextLong()));
        }
        SoInsu result = llist.stream().reduce(
                new SoInsu(1L),
                (a, b)->
                    SoInsu.LCM(a,b)
                );
        long ans = llist.stream().map(p->result.waru(p)).collect(Collectors.summingLong(Long::longValue));
        System.out.println(ans % 1000000007);
    }

    public static class SoInsu{
        Map<Long, Long> mp = new HashMap<>();
        public SoInsu(long a){
            for(Long s:sosuu){
                if(a % s == 0){
                    long cnt=0;
                    while(a % s == 0){
                        a /= s;
                        cnt++;
                    }
                    mp.put(s, cnt);
                }
                if(a < s){break;}
            }
        }
        public SoInsu(){}

        public static SoInsu LCM(SoInsu a, SoInsu b){
            SoInsu ret = new SoInsu();
            for(Long k: a.mp.keySet()){
                if(b.mp.containsKey(k)){
                    ret.mp.put(k, Math.max(a.mp.get(k), b.mp.get(k)));
                }else{
                    ret.mp.put(k, a.mp.get(k));
                }
            }
            for(Long k: b.mp.keySet()){
                if(ret.mp.containsKey(k)){
                    ret.mp.put(k, Math.max(a.mp.get(k), b.mp.get(k)));
                }else{
                    ret.mp.put(k, b.mp.get(k));
                }
            }
            return ret;
        }

        public long waru(SoInsu p){
            long res = 1;
            for(Long k:mp.keySet()){
                long s =mp.get(k);
                if(p.mp.containsKey(k)){
                    s -= p.mp.get(k);
                }
                res *= pow(k, s);
                res %= MOD;
            }
            return res;
        }

        @Override
        public String toString(){
            return mp.toString();
        }
    }
}