#include <iostream>
#include <string>
#include <vector>
#include <set>
#include <cmath>
#include <algorithm>
#include <iomanip>
#include <queue>
using ll = long long;
using namespace std;
int arr[110];
int aut[110];
int main(void)
{
    int N;
    cin >> N;
    int sum = 0;
    for (int i = 0; i < N; ++i)
    {
        cin >> arr[i];
        sum += arr[i];
    }
    int t = 0;
    int i = 1;
    int cnt = 0;
    for (;; i += 2)
    {
        t += i;
        if (t > sum)
        {
            t -= i;
            i -= 2;
            break;
        }
        cnt++;
    }
    for (int j = 0; j < cnt; ++j)
    {
        aut[j] = j + 1;
    }
    for (int j = cnt; j < N; ++j)
    {
        if (cnt <= 0)
            aut[j] = 0;
        else
            aut[j] = --cnt;
    }
    for (int j = 0; j < N; ++j)
    {
        cout << aut[j] << endl;
    }
    int a = 0;

    t = 0; //不足分を管理
    for (int j = 0; j < N; ++j)
    {
        if (arr[j] < aut[j])
        {
            t += aut[j] - arr[j];
        }
    }

    for (int j = 0; j < N; ++j)
    {
        if (arr[j] > aut[j])
        {
            a += arr[j] - aut[j];
        }
    }
    cout << max(t, a) << endl;
    return 0;
}