#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, a, b) for(int i = a; i < b; i++)
#define  all(x) (x).begin(),(x).end()     // 昇順ソート
#define  rall(v) (v).rbegin(), (v).rend() // 降順ソート
#define  FastIO ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
typedef long long ll;
typedef long long int lli;
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return true; } return false; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return true; } return false; }

int dx[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy[] = {0, 1, 1, 1, 0, -1, -1, -1};

int main(){
    int n;
    cin >> n;
    vector<int> a(n+2);
    for(int i = 1; i <= n; i++){
        cin >> a[i];
    }
    int sum = 0;
    for(int i = 0; i <= n; i++){
        sum += abs(a[i] - a[i+1]);
    }
    for(int i = 1; i <= n; i++){
        int ans = sum;
        ans -= abs(a[i]-a[i-1]);
        ans -= abs(a[i+1]-a[i]);
        ans += abs(a[i+1]-a[i-1]);
        cout << ans << endl;
    }
    return 0;
}
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#include <functional>
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define ALL(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
using namespace std;
using ll = long long;
constexpr int inf = 1000000000;
constexpr ll INF = 1000000000000000000;
template <typename T> bool chmin(T &x, const T &y) {if (x < y) {x = y; return true;} return false;}
template <typename T> bool chmax(T &x, const T &y) {if (x > y) {x = y; return true;} return false;}

int main() {
    int N;
    cin >> N;
    vector<ll> A(N);
    rep(i, N) cin >> A[i];
    
    vector<ll> B(N, 0), C(N, 0);
    B[0] = abs(A[0]);
    for (int i = 1; i < N; ++i) B[i] = B[i - 1] + abs(A[i] - A[i - 1]);
    reverse(ALL(A));
    C[0] = abs(A[0]);
    for (int i = 1; i < N; ++i) C[i] = C[i - 1] + abs(A[i] - A[i - 1]);
    reverse(ALL(A));
    reverse(ALL(C));
    rep(i, N) {
        if (i == 0) cout << C[i + 1] + abs(A[i + 1]) << "\n";
        else if (i == N - 1) cout << B[i - 1] + abs(A[i - 1]) << "\n";
        else cout << B[i - 1] + abs(A[i + 1] - A[i - 1]) + C[i + 1] << "\n";
    }
    return 0;
}
