#include <bits/stdc++.h>
using namespace std;
int main(){
	int N;
	cin >> N;
	vector<long long> A(N);
	for (int i = 0; i < N; i++){
		cin >> A[i];
	}
	multiset<long long> ms;
	long long ans = 1e18;
	for (int i = 0; i < N; i++){
		auto it = ms.lower_bound(A[i]);
		if (i != 0 and it != ms.end()){
			ans = min(ans, *it - A[i]);
		}
		if (it != ms.begin()){
			it--;
			ans = min(ans, A[i] - *it);
		}
		ms.insert(A[i]);
		if (i == 0){
			cout << 0 << endl;
		} else {
			cout << ans << endl;
		}
	}
}