#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;
}