/* -*- coding: utf-8 -*-
 *
 * 2821.cc:  No.2821 A[i] 竊・2A[j] - A[i] - yukicoder
 */

#include<cstdio>
#include<set>
#include<algorithm>

using namespace std;

/* constant */

const int MAX_N = 300000;
const long long LINF = 1LL << 62;

/* typedef */

using ll = long long;
using sl = set<ll>;

/* global variables */

ll as[MAX_N], ds[MAX_N];

/* subroutines */

/* main */

int main() {
  int n;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) scanf("%lld", as + i);

  ll mind = LINF;
  sl bs;
  bs.insert(as[0]);
  for (int i = 1; i < n; i++) {
    auto [sit, f] = bs.insert(as[i]);
    if (f) {
      if (sit != bs.begin()) {
	auto sit0 = sit; sit0--;
	mind = min(mind, as[i] - *sit0);
      }
      auto sit1 = sit; sit1++;
      if (sit1 != bs.end()) {
	mind = min(mind, *sit1 - as[i]);
      }
      ds[i] = mind;
    }
    else
      ds[i] = ds[i - 1];
  }

  for (int i = 0; i < n; i++) printf("%d\n", ds[i]);
  
  return 0;
}