#include <iostream>
#include <algorithm>
using namespace std;
int main() {
int n;
cin >> n;
int a[n];
for (int i = 0; i < n; i++) {
cin >> a[i];
}
if (n == 2) {
cout << abs(a[1] - a[0]);
return 0;
}
sort(a, a + n);
int dp[n];
dp[0] = a[1] - a[0];
for (int i = 1; i < n - 1; i++) {
if (dp[i - 1] == a[i] - a[i - 1]) {
dp[i] = 0;
} else {
dp[i] = min(a[i] - a[i - 1], a[i + 1] - a[i]);
}
}
if (dp[n - 2] == a[n - 1] - a[n - 2]) {
dp[n - 1] = 0;
} else {
dp[n - 1] = a[n - 1] - a[n - 2];
}
int sum = 0;
for (int i = 0; i < n; i++) {
sum += dp[i];
cout << dp[i] << " ";
}
cout << '\n' << sum;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgojaW5jbHVkZSA8YWxnb3JpdGhtPgoKdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBtYWluKCkgewoJaW50IG47CiAgCWNpbiA+PiBuOwogIAlpbnQgYVtuXTsKICAgIGZvciAoaW50IGkgPSAwOyBpIDwgbjsgaSsrKSB7CgkJY2luID4+IGFbaV07CiAgICB9CiAgICBpZiAobiA9PSAyKSB7CgkJY291dCA8PCBhYnMoYVsxXSAtIGFbMF0pOwogICAgICAJcmV0dXJuIDA7CiAgICB9CiAgCXNvcnQoYSwgYSArIG4pOwogIAlpbnQgZHBbbl07CiAgCWRwWzBdID0gYVsxXSAtIGFbMF07CiAgICBmb3IgKGludCBpID0gMTsgaSA8IG4gLSAxOyBpKyspIHsKICAgICAgICBpZiAoZHBbaSAtIDFdID09IGFbaV0gLSBhW2kgLSAxXSkgewoJCQlkcFtpXSA9IDA7CiAgICAgICAgfSBlbHNlIHsKICAgICAgICAgIAlkcFtpXSA9IG1pbihhW2ldIC0gYVtpIC0gMV0sIGFbaSArIDFdIC0gYVtpXSk7CiAgICAgICAgfQogICAgfQogIAlpZiAoZHBbbiAtIDJdID09IGFbbiAtIDFdIC0gYVtuIC0gMl0pIHsKICAgICAgCWRwW24gLSAxXSA9IDA7CiAgICB9IGVsc2UgewogICAgICAJZHBbbiAtIDFdID0gYVtuIC0gMV0gLSBhW24gLSAyXTsKICAgIH0KICAJaW50IHN1bSA9IDA7CiAgICBmb3IgKGludCBpID0gMDsgaSA8IG47IGkrKykgewoJCXN1bSArPSBkcFtpXTsKCQljb3V0IDw8IGRwW2ldIDw8ICIgIjsKICAgIH0KICAJY291dCA8PCAnXG4nIDw8IHN1bTsKfQ==