// Original C++ solution (slower):
/*****************

 *   I<3   C++   *

 *  IWANT ANYAC  *

 * ILOVEPROGRAM! *

 *IT'SINTERESTING*

 * ILOVEPROGRAM! *

 *  INCONTESTS   *

 *   GETSCORE    *

 *    ACCODE     *

 *     LETS      *

 *      GO       *

 *Written by:    *

 *    charlieyan *

 *****************/

#include <assert.h>

#include <ctype.h>

#include <errno.h>

#include <float.h>

#include <fstream>

#include <iomanip>

#include <iostream>

#include <limits>

#include <locale>

#include <math.h>

#include <stdio.h>

#include <stdlib.h>

#include <string.h>

#include <time.h>

#include <wchar.h>

#include <wctype.h>

#include <algorithm>

#include <bitset>

#include <cctype>

#include <cerrno>

#include <clocale>

#include <cmath>

#include <complex>

#include <cstdio>

#include <cstdlib>

#include <cstring>

#include <ctime>

#include <deque>

#include <exception>

#include <fstream>

#include <functional>

#include <limits>

#include <map>

#include <iomanip>

#include <ios>

#include <iosfwd>

#include <istream>

#include <ostream>

#include <queue>

#include <set>

#include <sstream>

#include <stack>

#include <stdexcept>

#include <streambuf>

#include <string>

#include <utility>

#include <vector>

#include <cwchar>

#include <cwctype>

#include <complex.h>

#include <fenv.h>

#include <inttypes.h>

#include <stdbool.h>

#include <stdint.h>

#include <tgmath.h>

#include <numeric>

#include <list>

#define LL long long

#define pb push_back

#define pob pop_back

#define mp make_pair

#define FILL(a,v) memset((void*)a,v,sizeof(a))

#define FILL0(a) FILL(a,0)

#define FILL1(a) FILL(a,-1)

#define FILLBIG(a) FILL(a,0x7f)

#define ALL(a) (a).begin(),(a).end()

#define Inf ((int)0x7f7f7f7f)

#define INF ((long long)0x7f7f7f7f7f7f7f7f)

#define Mod 1000000007

#define foreach(it,x) for(__typeof(x.begin()) it=x.begin();it!=x.end();it++)

#define FOR(i,x) for(int i=0;i<x;i++)

#define RFOR(i,x) for(int i=x-1;i>=0;i--)

#define FFOR(i,a,b) for(int i=a;i<b;i++)

#define FRFOR(i,a,b) for(int i=a-1;i>=b;i--)

#define SZ(a) ((int)(a).size())

#define FI first

#define SE second

#define OVER(a) return puts(a),0

#define fastio ios::sync_with_stdio(0)

#define filei(f) freopen(f,"r",stdin)

#define fileo(f) freopen(f,"w",stdout)

#define eprintf(...) fprintf(stderr,__VA_ARGS__)

#define MASK(a) (1<<(a))

#define MASKX(x,a) ((x)<<(a))

#define BIT(a,b) ((a>>b)&1)

#define cddx(a) priority_queue<a >

#define cxdd(a) priority_queue<a,vector<a >,greater<a > >

#define deval(a) {cerr<<#a<<" = "<<a<<endl;}

#define dearr(be,en) {cerr<<#be;cerr<<" = {";for(auto i=be;i!=en;i++)cerr<<' '<<*i;cerr<<" }\n";}

#define reg register

#define prtime eprintf("\n\nTime used: %dms\n",clock());

#define PI 3.1415926535897932384626

//Xuzhen[The virus] is a BIG 13 !!!

using namespace std;

typedef pair<int,int> pii;

typedef unsigned long long UINT;

typedef unsigned int uint;

typedef long long INT;

typedef long double ldouble;

typedef pair<INT,INT> PII;

typedef stringstream sst;

typedef istringstream iss;

typedef vector<int> vint;

typedef vector<INT> VINT;

typedef vector<pii> vpii;

typedef vector<PII> VPII;

typedef priority_queue<int> pqi;

typedef priority_queue<INT> PQI;

typedef priority_queue<pii> pqp;

typedef priority_queue<PII> PQP;

typedef priority_queue<int,vint,greater<int> > xqi;

typedef priority_queue<INT,VINT,greater<INT> > XQI;

typedef priority_queue<pii,vpii,greater<pii> > xqp;

typedef priority_queue<PII,VPII,greater<PII> > XQP;



int n,a[100007];

int gxz[100007];



int main()

{

	scanf("%d",&n);

	for(int i=1;i<=n;i++)scanf("%d",a+i);

	a[0]=0;

	a[n+1]=0;

	int sum=0;

	for(int i=1;i<=n;i++)

	{

		sum+=abs(a[i]-a[i-1]);

		gxz[i]=abs(a[i]-a[i-1])+abs(a[i+1]-a[i])-abs(a[i+1]-a[i-1]);

	}

	sum+=abs(a[n]);

	for(int i=1;i<=n;i++)printf("%d\n",sum-gxz[i]);

	return 0;

}

// Optimized solution to the same problem (faster):
#include <cstdio>

#include <cctype>



int n, a[100010], tot;



int read() {

    int ret, fl = 1;

    char ch;

    while(!isdigit(ch = getchar()))

        (ch == '-') && (fl = -1);

    ret = ch - '0';

    while(isdigit(ch = getchar()))

        ret *= 10, ret += ch - '0';

    return ret * fl;

}



void print(int x) {

    if(x < 0) putchar('-'), x = -x;

    if(x > 9) print(x / 10);

    putchar(x % 10 + '0');

}



int abs(int x) {

    return x > 0 ? x : -x;

}



int main() {

    n = read();

    for(int i = 1; i <= n; ++i)

        a[i] = read(), tot += abs(a[i] - a[i - 1]);

    tot += abs(a[n]);

    for(int i = 1; i <= n; ++i) {

        int ans;

        if(a[i] > a[i - 1]) {

            if(a[i + 1] > a[i]) ans = tot;

            else {

                if(a[i + 1] > a[i - 1]) ans = tot + a[i + 1] * 2 - a[i] * 2;

                else ans = tot + a[i - 1] * 2 - a[i] * 2;

            }

        }

        else {

            if(a[i + 1] < a[i]) ans = tot;

            else {

                if(a[i + 1] > a[i - 1]) ans = tot + a[i] * 2 - a[i - 1] * 2;

                else ans = tot + a[i] * 2 - a[i + 1] * 2;

            }

        }

        print(ans), putchar('\n');

    }

    return 0;

}

// Fastest known solution for this problem: