Problem Statement

Nathan O. Davis is a student at the department of integrated systems.

Today's agenda in the class is audio signal processing. Nathan was given a lot of homework out. One of the homework was to write a program to process an audio signal. He copied the given audio signal to his USB memory and brought it back to his home.

When he started his homework, he unfortunately dropped the USB memory to the floor. He checked the contents of the USB memory and found that the audio signal data got broken.

There are several characteristics in the audio signal that he copied.

* The audio signal is a sequence of $N$ samples.

* Each sample in the audio signal is numbered from $1$ to $N$ and represented as an integer value.

* Each value of the odd-numbered sample(s) is strictly smaller than the value(s) of its neighboring sample(s).

* Each value of the even-numbered sample(s) is strictly larger than the value(s) of its neighboring sample(s).




He got into a panic and asked you for a help. You tried to recover the audio signal from his USB memory but some samples of the audio signal are broken and could not be recovered. Fortunately, you found from the metadata that all the broken samples have the same integer value.

Your task is to write a program, which takes the broken audio signal extracted from his USB memory as its input, to detect whether the audio signal can be recovered uniquely.

Input

The input consists of multiple datasets. The form of each dataset is described below.

> $N$
> $a_{1}$ $a_{2}$ ... $a_{N}$

The first line of each dataset consists of an integer, $N (2 \le N \le 1{,}000)$. $N$ denotes the number of samples in the given audio signal. The second line of each dataset consists of $N$ values separated by spaces. The $i$-th value, $a_{i}$, is either a character `x` or an integer between $-10^9$ and $10^9$, inclusive. It represents the $i$-th sample of the broken audio signal. If $a_{i}$ is a character `x` , it denotes that $i$-th sample in the audio signal is broken. Otherwise it denotes the value of the $i$-th sample.

The end of input is indicated by a single $0$. This is not included in the datasets.

You may assume that the number of the datasets does not exceed $100$.

Output

For each dataset, output the value of the broken samples in one line if the original audio signal can be recovered uniquely. If there are multiple possible values, output `ambiguous`. If there are no possible values, output `none`.

Sample Input


5
1 x 2 4 x
2
x x
2
1 2
2
2 1
2
1000000000 x
4
x 2 1 x
0

Output for the Sample Input


3
none
ambiguous
none
ambiguous
none





Example

Input

5
1 x 2 4 x
2
x x
2
1 2
2
2 1
2
1000000000 x
4
x 2 1 x
0


Output

3
none
ambiguous
none
ambiguous
none
#include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define o(a) cout << a << endl
#define int long long
#define first fi;
#define second se;
using namespace std;
typedef pair<int, int> P;

int change_to_i(string s){
    stringstream ss; int k;
    ss<<s; ss>>k;
    return k;
}
const int INF = 1e12;

signed main(){
    int n;
    while(cin >> n, n){
        string s;
        vector<int> d(n);
        rep(i, 0, n){
            cin >> s;
            if(s == "x") d[i] = INF;
            else d[i] = change_to_i(s);
            // cout << d[i] << " ";
        }
        // cout << endl;
        bool f = true;
        int l = -1e10, r = 1e10;
        rep(i, 0, n){
            if(d[i] == INF){
                if(i - 1 >= 0 && d[i - 1] == INF) f = false;
                if(i + 1 < n && d[i + 1] == INF) f = false;
                if((i + 1) % 2){
                    if(i - 1 >= 0) r = min(r, d[i - 1] - 1);
                    if(i + 1 < n) r = min(r, d[i + 1] - 1);
                }else{
                    if(i - 1 >= 0) l = max(l, d[i - 1] + 1);
                    if(i + 1 < n) l = max(l, d[i + 1] + 1);
                }
            // cout << i << " " <<  l << " " << r << endl;
                
            }else{
                if((i + 1) % 2){
                    if(i - 1 >= 0 && d[i - 1] != INF && d[i - 1] <= d[i]) f = false;
                    if(i + 1 < n && d[i + 1] != INF && d[i] >= d[i + 1]) f = false;
                }else{
                    if(i - 1 >= 0 && d[i - 1] != INF &&  d[i - 1] >= d[i]) f = false;
                    if(i + 1 < n && d[i + 1] != INF && d[i] <= d[i + 1]) f = false;
                }
            }
        }
        // cout << l << " " << r << endl;
        if(l > r) f = false;
        if(!f) cout << "none" << endl;
        else if(l == r) cout << l << endl;
        else cout << "ambiguous" << endl;
    }
}