#include <bits/stdc++.h>
 
using namespace std;
 
#define MAXN 1000000
 
int a[MAXN + 1];
 
void solve(int n) {
 
    stack<int> s;
 
    int result = INT_MIN, cur;
 
    for (int i = 0; i < n; ++ i) {
       while (!s.empty() && s.top() >= a[i]) {
 
          int tmp = s.top(); s.pop();
          printf("max1 = %d %d\n", tmp, a[i]);
       }
 
       if (!s.empty()) printf("max2 = %d %d\n", a[i], s.top());
       s.push(a[i]);
    }
 
}
 
int main() {
 
    int N;
 
    scanf("%d", &N);
    for (int i = 0; i < N; ++ i) scanf("%d", &a[i]);
 
    solve(N);
 
    return 0;
}
 

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+Cgp1c2luZyBuYW1lc3BhY2Ugc3RkOwoKI2RlZmluZSBNQVhOIDEwMDAwMDAKCmludCBhW01BWE4gKyAxXTsKCnZvaWQgc29sdmUoaW50IG4pIHsKCiAgICBzdGFjazxpbnQ+IHM7CgogICAgaW50IHJlc3VsdCA9IElOVF9NSU4sIGN1cjsKCiAgICBmb3IgKGludCBpID0gMDsgaSA8IG47ICsrIGkpIHsKICAgICAgIHdoaWxlICghcy5lbXB0eSgpICYmIHMudG9wKCkgPj0gYVtpXSkgewoKICAgICAgICAgIGludCB0bXAgPSBzLnRvcCgpOyBzLnBvcCgpOwogICAgICAgICAgcHJpbnRmKCJtYXgxID0gJWQgJWRcbiIsIHRtcCwgYVtpXSk7CiAgICAgICB9CgogICAgICAgaWYgKCFzLmVtcHR5KCkpIHByaW50ZigibWF4MiA9ICVkICVkXG4iLCBhW2ldLCBzLnRvcCgpKTsKICAgICAgIHMucHVzaChhW2ldKTsKICAgIH0KCn0KCmludCBtYWluKCkgewoKICAgIGludCBOOwoKICAgIHNjYW5mKCIlZCIsICZOKTsKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgTjsgKysgaSkgc2NhbmYoIiVkIiwgJmFbaV0pOwoKICAgIHNvbHZlKE4pOwoKICAgIHJldHVybiAwOwp9Cg==

Ngo1IDYgMSAyIDkgMw==

6
5 6 1 2 9 3