#include<iostream>
#include<bits/stdc++.h>
#include<cstdlib>
using namespace std;
int main()
{
	int n,min,count=2,mins;
	cin >> n;
	list<int>ls;
	list<int>::iterator p,co;
	ptrdiff_t  dis;
	while (n--)
	{
		int x; cin >> x;
		ls.push_back(x);
	}
	for (list<int>::iterator it = next(ls.begin()); it != ls.end();++it)
	{
		co = it; min = *it;
		while (co!=ls.begin())
		{
			p = prev(co);
			if (abs((*it - *p))<=abs(min))
			{
				min = *it - *p;
			  dis = std::distance(p,it);
			}
			co = prev(co);
			mins = count - dis;
		}
		count++;
		cout << abs(min) <<" "<<mins<< endl;
    }
	return 0;
}