#include <iostream>
#include <set>
#include <limits.h>
#define Re register int
#define Rll register long long int
using namespace std;
typedef pair<int, int> pii;
set<pii> st;
int main(){
    int n;  cin >> n;
    for(Re i = 1; i <= n; i ++ ){
        Re tmp;    cin >> tmp;
        st.insert({tmp, i});
        if(i == 1)  continue;
        pii res = {INT_MAX, INT_MIN};
        set<pii>::iterator it = st.find({tmp, i});
        if( ++ it != st.end()){
            res = {it->first - tmp, it->second};
        }
        it = st.find({tmp, i});
        if(it -- != st.begin()){
            if(tmp - it->first <= res.first)    res = {tmp - it->first, it->second};
        }
        cout << res.first << ' ' << res.second << endl;
    }
    return 0;
}