#[allow(unused_imports)]
use std::{
    cell::RefCell, convert::{Infallible, TryFrom, TryInto as _},
    fmt::{self, Debug, Display, Formatter,}, fs::{File}, hash::{Hash, Hasher},
    iter::{Product, Sum}, marker::PhantomData,
    ops::{Add, AddAssign, Sub, SubAssign, Div, DivAssign, Mul, MulAssign, Neg, RangeBounds},
    str::{FromStr, SplitWhitespace}, sync::{atomic::{self, AtomicU32, AtomicU64}, Once},
    collections::{*, btree_map::Range}, mem::{swap},
    cmp::{self, Reverse, Ordering, Eq, PartialEq, PartialOrd},
    thread::LocalKey, f64::consts::PI, time::Instant, rc::Rc,
    ptr::null_mut,
    io::{self, stdin, Read, read_to_string, BufWriter, BufReader, stdout, Write},
};
#[allow(unused_imports)]
use proconio::{input, input_interactive, marker::{*}};
#[allow(unused_imports)]
//use rand::{thread_rng, Rng, seq::SliceRandom};
#[allow(unused_imports)]
//use ac_library::{*};

#[allow(dead_code)]
const INF: i64 = 1<<61;
#[allow(dead_code)]
const MOD: i64 = 998244353;
#[allow(dead_code)]
const D: [(usize, usize); 4] = [(1, 0), (0, 1), (!0, 0), (0, !0)];

pub fn modulo(x: i64, y: i64)->i64{
    (x%y+y)%y
}

pub fn gcd(a: i64, b: i64)->i64{
    if b==0{
        a
    } else {
        gcd(b, modulo(a, b))
    }
}

//use proconio::fastout;
//#[fastout]
fn main() {
    input! {
        n: usize,
        mut c: [i64; n],
    }
    c.sort();
    let (mut a, mut b) = (0, 1);
    for i in 0..n-1{
        let (x, y) = (c[i], c[i+1]);
        if a*y < x*b{
            let g = gcd(x, y);
            (a, b) = (x/g, y/g);
        }
    }
    println!("{} {}", a, b);
}