import std.stdio, std.string, std.conv;
import std.range, std.algorithm, std.array, std.typecons, std.container;
import std.math, std.numeric, core.bitop;

enum inf3 = 1_001_001_001;
enum inf6 = 1_001_001_001_001_001_001L;
enum mod = 1_000_000_007L;

alias Pair = Tuple!(long, "x", int, "i");

void main() {
    int k;
    scan(k);
    auto a = readln.split.to!(long[]);

    long low = 2, high = 2;

    foreach_reverse (i ; 0 .. k) {
        low = ((low + a[i] - 1) / a[i]) * a[i];
        high = (high / a[i]) * a[i] + a[i] - 1;
        debug {
            writefln("low: %d, high: %d", low, high);
        }
    }

    if (low > high) {
        writeln(-1);
        return;
    }

    writeln(low, " ", high);
}







void scan(T...)(ref T args) {
    import std.stdio : readln;
    import std.algorithm : splitter;
    import std.conv : to;
    import std.range.primitives;

    auto line = readln().splitter();
    foreach (ref arg; args) {
        arg = line.front.to!(typeof(arg));
        line.popFront();
    }
    assert(line.empty);
}

void fillAll(R, T)(ref R arr, T value) {
    static if (is(typeof(arr[] = value))) {
        arr[] = value;
    }
    else {
        foreach (ref e; arr) {
            fillAll(e, value);
        }
    }
}
