#include<stdio.h>
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
 
using namespace std;
 
//conversion
//------------------------------------------
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
 
//math
//-------------------------------------------
template<class T> inline T sqr(T x) {return x*x;}
 
//typedef
//------------------------------------------
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;
 
//container util
//------------------------------------------
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
 
//repetition
//------------------------------------------
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
 
//constant
//--------------------------------------------
const double EPS = 1e-10;
const double PI  = acos(-1.0);
 
//clear memory
#define CLR(a) memset((a), 0 ,sizeof(a))
 
//debug
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
 
int main(void){
	// LL child = 0;
	unsigned long long k;
	vector<unsigned long long> a;
	cin >> k;
	REP(i, k){
		unsigned long long v;
		cin >> v;
		a.PB(v);
	}
	// unsigned long long _min = 10e10;
	unsigned long long _max = 0;
	// for (unsigned long long i = 1; i < 10e9; i++)
	// {
	// 	child = i;
	// 	REP(j, k)
	// 	{
	// 		child = child - child %a[j];
	// 		if(child == 0 || child == 1)
	// 			break;
	// 	}
	// 	if(child == 2){
	// 		_min = min(i, _min);
	// 		_max = max(i, _max);
	// 	}
	// 	else if(child > 2){
	// 		break;
	// 	}
	// }
	// if (_min >= 2 && _max >= 2){
	// 	cout << _min << " " << _max << endl;
	// }
	// else
	// 	cout << -1 << endl;
	reverse(a.begin(), a.end());
	unsigned long long child = 2;
	unsigned long long maxChild = 2;
	for (unsigned long long i = 0; i < k; i++)
	{
		
		child = ceil((double)child / (double)a[i]) * a[i];
		maxChild = (maxChild / a[i]) * a[i] + a[i] - 1;
		// debug(a[i]);
		// debug(child);
		// debug(maxChild);
		if(child > maxChild){
			cout << -1 << endl;
			return 0;
		}
	}
	// unsigned long long min = child;
	// child = 2;
	// unsigned long long max = child + a.back()-1;
	// reverse(a.begin(), a.end());
	// for (unsigned long long i = min; i < min + 10e8; i++)
	// {
	// 	child = i;
	// 	REP(j, k)
	// 	{
	// 		child = child - child %a[j];
	// 		if(child == 0 || child == 1)
	// 			break;
	// 	}
	// 	if(child == 2){
	// 		_max = std::max(i, _max);
	// 	}
	// 	else if(child > 2){
	// 		break;
	// 	}
	// }
	cout << child << " " << maxChild << endl;
	// cout << min <<" "<< _max << endl;
	return 0;
}



Measured memory_bytes: 1400