#include <iostream>

using namespace std;

int sor[200005] = {};

void kovetkezo(int N, int sum)
{
    int temp_sor[200005] = {};
    for(int i = 1; i <= N; i++){
        temp_sor[i] = sor[i];
    }

    int curr_sum = sum;
    int index = N;
    while(curr_sum == sum || temp_sor[index-1] == temp_sor[index]){
        curr_sum -= temp_sor[index];
        index--;
    }
    curr_sum++;
    temp_sor[index]++;
    index++;
    while(curr_sum < sum){
        temp_sor[index] = 1;
        index++;
        curr_sum++;
    }
    curr_sum = 0;
    for(int i = 1; curr_sum < sum; i++){
        cout << temp_sor[i] << " ";
        curr_sum += temp_sor[i];
    }
    cout << endl;
}

void elozo(int N, int sum)
{
    int temp_sor[200005] = {};
    for(int i = 1; i <= N; i++){
        temp_sor[i] = sor[i];
    }

    int curr_sum = sum;
    int index = N;
    while(temp_sor[index] == 1){
        curr_sum--;
        index--;
    }
    temp_sor[index]--;
    curr_sum--;
    index++;
    while(curr_sum < sum){
        if(sum - curr_sum <= temp_sor[index-1]){
            temp_sor[index] = sum - curr_sum;
            break;
        }
        temp_sor[index] = temp_sor[index-1];
        index++;
        curr_sum += temp_sor[index];
    }

    curr_sum = 0;
    for(int i = 1; curr_sum < sum; i++){
        cout << temp_sor[i] << " ";
        curr_sum += temp_sor[i];
    }
    cout << endl;
}

int main()
{
    int N;
    cin >> N;
    int sum = 0;
    for(int i = 1; i <= N; i++){
        cin >> sor[i];
        sum += sor[i];
    }
    kovetkezo(N, sum);
    elozo(N, sum);

    return 0;
}