#include<bits/stdc++.h>
using namespace std;
int findit(int *a,int n)
{
int max1=INT_MIN;
int sum=0;
for(int i=0;i<n;i++)
{
if(i=n-1)
sum=a[i]+a[0]+1;
else
sum=a[i]+a[i+1]+1;
cout<<sum<<" ";
if(sum>max1)
max1=sum;
}
return max1;
}
int main()
{
int n,i;
cin>>n;
int a[n];
for(i=0;i<n;i++)
cin>>a[i];
int r=findit(a,n);
cout<<endl<<r<<endl;
}
I2luY2x1ZGU8Yml0cy9zdGRjKysuaD4KdXNpbmcgbmFtZXNwYWNlIHN0ZDsKCmludCBmaW5kaXQoaW50ICphLGludCBuKQp7CiAgICBpbnQgbWF4MT1JTlRfTUlOOwogICAgaW50IHN1bT0wOwogICAgZm9yKGludCBpPTA7aTxuO2krKykKICAgIHsKICAgICAgICBpZihpPW4tMSkKICAgICAgICAgICAgc3VtPWFbaV0rYVswXSsxOwogICAgICAgIGVsc2UKICAgICAgICAgICAgc3VtPWFbaV0rYVtpKzFdKzE7CiAgICAgICAgY291dDw8c3VtPDwiICI7CiAgICAgICAgaWYoc3VtPm1heDEpCiAgICAgICAgICAgIG1heDE9c3VtOwogICAgfQogICAgcmV0dXJuIG1heDE7Cn0KCmludCBtYWluKCkKewogICAgaW50IG4saTsKICAgIGNpbj4+bjsKICAgIGludCBhW25dOwogICAgZm9yKGk9MDtpPG47aSsrKQogICAgICAgIGNpbj4+YVtpXTsKICAgIGludCByPWZpbmRpdChhLG4pOwogICAgY291dDw8ZW5kbDw8cjw8ZW5kbDsKfQo=