ANTSORT

#include <set>
#include <cmath>
#include <iostream>
#include <vector>
#include <algorithm>
#include <cstdio>
#include <numeric>
#include <string>
#include <climits>
#include <stack>
#include <queue>
using namespace std;
const int N = 3e5;
long long a[N+1], b[N+1], n;
void read()
{
    cin >> n;
    for (int i = 1; i <= n; ++ i)
    {
        cin >> a[i];
    }
}
bool check(long long x)
{
    for (int i = 1; i <= n; ++ i)
    {
        b[i] = a[i];
        if (i == 1)
        {
            b[i] -= x;
        }
        else
        {
            if (a[i] < b[i-1])
            {
                b[i] = min(b[i-1] + 1, b[i] + x);
            }
            else if (b[i-1] + 1 <= b[i] + x)
            {
                b[i] = max(b[i-1] + 1, b[i] - x);
            }
            if (b[i-1] >= b[i])
            {
                return false;
            }
        }
    }
    return true;
}
void solve()
{
    long long low = 1, high = 1e18;
    while (low <= high)
    {
        long long mid = (low + high)/2;
        if (check(mid))
        {
            high = mid - 1;
        }
        else
        {
           low = mid + 1;
        }
    }
    if (n == 1)
    {
        cout << 0 << '\n'<<a[1]; return ;
    }
    cout << low << '\n';
    check(low);
    for (int i = 1; i <= n; ++ i)
    {
        cout << b[i] <<' ';
    }
}
int main()
{
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   read();
   solve();
}