#include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <ctime>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <set>
#include <map>
#include <iostream>
#include <deque>
#include <complex>
#include <string>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <valarray>
#include <unordered_map>
#include <iterator>
#include <functional>
#include <cassert>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define REPS(i,x) for(int i=1;i<=(int)(x);i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)
#define ALL(container) (container).begin(), (container).end()
#define RALL(container) (container).rbegin(), (container).rend()
#define SZ(container) ((int)container.size())
#define mp(a,b) make_pair(a, b)
#define pb push_back
#define eb emplace_back
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os;
}
template<class T> ostream& operator<<(ostream &os, const set<T> &t) {
os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}
template<class S, class T> pair<S,T> operator+(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first+t.first, s.second+t.second);}
template<class S, class T> pair<S,T> operator-(const pair<S,T> &s, const pair<S,T> &t){ return pair<S,T>(s.first-t.first, s.second-t.second);}

const int INF = 1<<28;
const double EPS = 1e-8;
const int MOD = 1000000007;


int T, n, m;

vector<ll> count(ll x){	// count [0, x)
	vector<ll> ans;
	ll sum = 0;
	RREP(i, n + 1){
		if(1 & (x >> i)){
			x -= 1ll << i;
			ans.pb(sum + x);
			sum += (1ll << i) / 2;
		}else ans.pb(sum);
	}
	reverse(ALL(ans));
	return ans;
}

void check(vector<ll> &d, ll l, ll r, vector<pll> &ans){ // check [0, r)
	if(l <= 0 || r <= 0 || r <= l || r > 1000000000000000001ll) return;
	auto rv = count(r);
	auto lv = count(l);
/*	cout << "check " << l << ", " << r << ": " << endl;
	cout << lv << endl;
	cout << rv << endl;
	cout << d << endl;
*/
	d.pb(0);
	if([&](){
		REP(i, d.size()) if(d[i] != rv[i] - lv[i]) return 0;
		return 1;
	}()) ans.eb(l, r);
	d.pop_back();
}

int main(int argc, char *argv[]){
	while(scanf("%d", &n), n){
		vector<ll> d(n);
		REP(i, n) scanf("%lld", &d[i]);
		while(!d.empty() && d.back() == 0) d.pop_back();
		n = d.size();
		vector<pll> ans;
		if(!n || n > 60){
			puts("None"); continue;
		}
		
		REP(i, 3){
			ll r = (1ll<<(n-1)) + d[n-1];
			ll w = d[0] * 2 - 1 + i;
			check(d, r - w, r, ans);
		}
		
		ll w = d.back();
		ll r = (1ll<<(n-1));
		RREP(i, n-1)if(d[i]){
			r += 1ll << i;
			if(d[i] == w) continue;
			r += d[i];
			check(d, r - w, r, ans);
			break;
		}
		check(d, r, r + 1, ans);
		sort(ALL(ans)); UNIQUE(ans);
		if(ans.empty()) puts("None");
		else if(ans.size() > 1) puts("Many");
		else printf("%lld %lld\n", ans[0].first, ans[0].second - 1);
	}
	return 0;
}

Measured memory_bytes: 1204