#[allow(dead_code)]
fn is_whitespace(c: &char) -> bool {
    c.is_whitespace()
}

#[allow(dead_code)]
fn is_eol(c: &char) -> bool {
    ['\r', '\n'].contains(c)
}

#[allow(unused_macros)]
macro_rules! input {
    ($var:ident, $($r:tt)*) => {
        input_inner!{$var, $($r)*}
    };

    ($($r:tt)*) => {
        let stdin = std::io::stdin();
        let mut bytes = std::io::Read::bytes(std::io::BufReader::new(stdin.lock()));
        #[allow(unused_mut, unused_variables, bare_trait_objects)]
        let mut next = move |f: &Fn(&char)->bool| -> String{
            bytes
                .by_ref()
                .map(|r|r.unwrap() as char)
                .skip_while(|c|f(&c))
                .take_while(|c|!f(&c))
                .collect()
        };
        input_inner!{next, $($r)*};
    };
}

#[allow(unused_macros)]
macro_rules! input_inner {
    ($next:expr) => {};
    ($next:expr, ) => {};

    ($next:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };

    ($next:expr, mut $var:ident : $t:tt $($r:tt)*) => {
        let mut $var = read_value!($next, $t);
        input_inner!{$next $($r)*}
    };
}

#[allow(unused_macros)]
macro_rules! read_value {
    ($next:expr, ( $($t:tt),* )) => {
        ( $(read_value!($next, $t)),* )
    };

    ($next:expr, [ $t:tt ; eol ]) => {
        $next(&is_eol).split(' ').map(|x| x.parse::<$t>().unwrap()).collect::<Vec<_>>()
    };

    ($next:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($next, $t)).collect::<Vec<_>>()
    };

    ($next:expr, chars) => {
        read_value!($next, String).chars().collect::<Vec<char>>()
    };

    ($next:expr, bytes) => {
        read_value!($next, String).into_bytes()
    };

    ($next:expr, usize1) => {
        read_value!($next, usize) - 1
    };

    ($next:expr, parser) => {
        $next
    };

    ($next:expr, $t:ty) => {
        $next(&is_whitespace).parse::<$t>().expect("Parse error")
    };
}

#[allow(unused_imports)]
use std::cmp::{max, min};
#[allow(unused_imports)]
use std::collections::{BinaryHeap, HashMap};

#[allow(dead_code)]
type Graph = Vec<Vec<usize>>;
#[allow(dead_code)]
const M: usize = 1e9 as usize + 7;

fn gcd(a: usize, b: usize) -> usize {
    if b != 0 {
        gcd(b, a % b)
    } else {
        a
    }
}

fn lcm(a: usize, b: usize) -> usize {
    a / gcd(a, b) * b
}

pub fn extgcd(a: i64, b: i64) -> (i64, i64, i64) {
    if b == 0 {
        (a, 1, 0)
    } else {
        let (gcd, x, y) = extgcd(b, a % b);
        (gcd, y, x - (a / b) * y)
    }
}

pub fn mod_inverse(a: usize, m: usize) -> usize {
    let (_, x, _) = extgcd(a as i64, m as i64);
    (x + m as i64) as usize % m
}

fn main() {
    input! {
        n: usize,
        a: [usize; n],
    }

    let mut primes = vec![0; 1001];
    let mut primes_ex = std::collections::HashSet::new();
    for i in 0..n {
        let mut k = 2;
        let mut t = a[i];
        while k * k <= t {
            let mut cnt = 0;
            while t % k == 0 {
                t /= k;
                cnt += 1;
            }
            primes[k] = max(primes[k], cnt);
            k += 1;
        }
        if t > 1 {
            if t >= 1000 {
                primes_ex.insert(t);
            } else {
                primes[t] = max(1, primes[t]);
            }
        }
    }

    let mut mult = 1;
    for i in 0..1001 {
        mult *= (i as usize).pow(primes[i]);
        mult %= M;
    }

    for x in primes_ex.iter() {
        mult *= *x;
        mult %= M;
    }

    // println!("{}", mult);
    let mut sum = 0;

    for i in 0..n {
        let mut x = mult;
        let mut k = 2;
        let mut t = a[i];
        let mut div = 1;
        while k * k <= t {
            while t % k == 0 {
                t /= k;
                div *= k;
                div %= M;
            }
            k += 1;
        }
        if t > 1 {
            div *= t;
            div %= M;
        }
        x *= mod_inverse(div, M);
        x %= M;
        sum += x;
        sum %= M;
    }

    println!("{}", sum);
}


Measured memory_bytes: 4476