#include <iostream>

using namespace std;
int n,a[10010],s,s1;

void Back1 (int szint) {
    int i=szint,t=0;
    while (a[i]==1) {
        i--;
        t++;
    }
    for (int j=1; j<i; j++) cout<<a[j]<<" ";
    cout<<a[i]-1<<" ";
    for (i; i<=szint; i++) cout<<1<<" ";
}
void Back2 (int szint) {
    if (a[n]==a[n-1]) {
        int i=n,sz=0;
        while (a[i]==a[i-1]) {
            sz=sz+a[i];
            i--;
        }
        sz=sz+a[i];
        for (int j=1; j<i; j++) cout<<a[j]<<" ";
        cout<<a[i]+1<<" ";
        sz=sz-a[i]-1;
        while (sz>0) {
            cout<<1<<" ";
            sz--;
        }
    }
    else {
        int i=n-1,sz=0;
        while (a[i]==a[i-1]) {
            sz=sz+a[i];
            i--;
        }
        if (sz>0) sz++;
        for (int j=1; j<i; j++) cout<<a[j]<<" ";
        cout<<a[i]+1<<" ";
        while (sz>0) {
            cout<<1<<" ";
            sz--;
        }
    }
}


int main()
{
    cin>>n;
    bool bencu=true;
    for (int i=1; i<=n; i++) {
            cin>>a[i];
            if (i>1 && a[i]!=a[i-1]) bencu=false;
            if (a[i]==1) s1++;
            s=s+a[i];
            }
    if (n==1) cout<<0;
    else {
        if (bencu) {
            int t=a[1]+1,sz=s;
            cout<<t<<" ";
            sz=sz-t;
            while (sz>0) {
                cout<<1<<" ";
                sz--;
            }
        }
        else Back2(n);
    }
    cout<<endl;
    if (n==s) cout<<0;
    else {
        if (n==s1+1) {
            int t=a[1]-1,sz=s;
            while (sz-t>0) {
                cout<<t<<" ";
                sz=sz-t;
            }
            cout<<sz<<endl;
        }
        else Back1(n);
    }
    cout<<endl;
    return 0;
}