import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format, std.datetime;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    long K = lread();
    auto A = aryread();
    long eval(long x)
    {
        foreach (i; 0 .. K)
            x = x - (x % A[i]);
        return x;
    }

    long a = () {
        long ok = 0;
        long ng = long.max / 2;
        while (1 < ng - ok)
        {
            long m = (ok + ng) / 2;
            if (eval(m) < 2)
                ok = m;
            else
                ng = m;
        }
        return ng;
    }();
    long b = () {
        long ok = 0;
        long ng = long.max / 2;
        while (1 < ng - ok)
        {
            long m = (ok + ng) / 2;
            if (eval(m) <= 2)
                ok = m;
            else
                ng = m;
        }
        return ok;
    }();
    if (b < a)
    {
        writeln(-1);
        return;
    }
    writefln("%s %s", a, b);
}
