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 Rust (1.15.1) (judge verdict: Accepted)

// This code is generated by [cargo-atcoder](https://github.com/tanakh/cargo-atcoder)
// Original source code:
/*
use num::traits::{one, zero};
use num::PrimInt;
use primal::Sieve;
use proconio::{fastout, input};
use std::collections::HashMap;

fn pow<T>(base: T, exponent: T, modulus: T) -> T
where
    T: PrimInt,
{
    let mut ret: T = one();
    let mut x = base;
    let mut y = exponent;
    while y > zero() {
        if y & one() == one() {
            ret = ret * x;
            ret = ret % modulus
        }
        x = x * x % modulus;
        y = y >> one();
    }
    ret
}

#[fastout]
fn main() {
    const M: u64 = 1_000_000_007;
    input! {
        n: u64,
        a: [u64; n],
    }
    let sieve = Sieve::new(1_000_000);
    let mut h = HashMap::new();
    for x in a.iter() {
        if let Ok(pairs) = sieve.factor(*x as usize) {
            for (prime, exponent) in pairs {
                let count = h.entry(prime as u64).or_insert(0);
                *count = std::cmp::max(*count, exponent as u64);
            }
        }
    }
    let mut l: u64 = 1;
    for (prime, exponent) in h {
        l *= pow(prime, exponent, M);
        l %= M;
    }
    let mut s: u64 = 0;
    for x in a.iter() {
        s += l * pow(*x, M - 2, M);
        s %= M;
    }
    println!("{}", s);
}

*/

fn main() {
    let exe = "/tmp/bin23A12D90";
    std::io::Write::write_all(&mut std::fs::File::create(exe).unwrap(), &decode(BIN)).unwrap();
    std::fs::set_permissions(exe, std::os::unix::fs::PermissionsExt::from_mode(0o755)).unwrap();
    std::process::exit(std::process::Command::new(exe).status().unwrap().code().unwrap())
}

fn decode(v: &str) -> Vec<u8> {
    let mut ret = vec![];
    let mut buf = 0;
    let mut tbl = vec![64; 256];
    for i in 0..64 { tbl[TBL[i] as usize] = i as u8; }
    for (i, c) in v.bytes().filter_map(|c| { let c = tbl[c as usize]; if c < 64 { Some(c) } else { None } }).enumerate() {
        match i % 4 {
            0 => buf = c << 2,
            1 => { ret.push(buf | c >> 4); buf = c << 4; }
            2 => { ret.push(buf | c >> 2); buf = c << 6; }
            3 => ret.push(buf | c),
            _ => unreachable!(),
        }
    }
    ret
}

const TBL: &'static [u8] = b"ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz0123456789+/";
const BIN: &'static str = "<base64-encoded ELF executable removed>";