import std.stdio, std.conv, std.string;
import std.algorithm, std.array, std.container;
import std.numeric, std.math;
import core.bitop;

T RD(T)() { static string[] ss; while(!ss.length) ss = readln.chomp.split; string res = ss[0]; ss.popFront; return res.to!T; }
string RDR()() { return readln.chomp; }

long mod = pow(10, 9) + 7;
long moda(long x, long y) { return (x + y) % mod; }
long mods(long x, long y) { return ((x + mod) - (y % mod)) % mod; }
long modm(long x, long y) { return (x * y) % mod; }

void main()
{
	auto N = RD!long;
	auto A = 0 ~ RDR.split.to!(long[]);
	A ~= 0;

	auto dp = new long[](N+2);

	foreach (i; 0..N+1)
	{
		dp[i+1] = dp[i] + abs(A[i+1] - A[i]);
	}

	foreach (i; 0..N)
	{
		writeln(dp[N+1] -  abs(A[i+1] - A[i]) - abs(A[i+2] - A[i+1]) + abs(A[i+2] - A[i]));
	}
	stdout.flush();
}