#include <bits/stdc++.h>

using namespace std;
using ll = long long;

const int MAXN = 100'001;

int a[MAXN];

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    int n, szum = 0; cin >> n;
    for (int i = 1; i <= n; i++) {
        cin >> a[i];
        szum += a[i];
    }
    if (n == 1) {
        cout << "0\n";
    } else {
        int k = a[n-1] + 1;
        vector<int> ans;
        for (int i = 1; i <= n; i++) {
            if (a[i] < k && i != n-1) {
                for (int j = 0; j < a[i] - (i == n); j++) ans.emplace_back(1);
            }
            else {
                if (i == n-1) {
                    ans.emplace_back(a[i]+1);
                }
                else {
                    ans.emplace_back(a[i]);
                }
            }
        }
        sort(ans.rbegin(), ans.rend());
        for (int i : ans) {
            cout << i << " ";
        }
        cout << "\n";
    }
    if (n == szum) {
        cout << "0\n";
    } else {
        int pos = 0;
        for (int i = 1; i <= n; i++) {
            if (a[i] >= 2) pos = i; 
        }
        int x = 1;
        for (int i = pos+1; i <= n; i++) {
            x += a[i];
        }
        vector<int> ans = {a[pos] - 1};
        for (int i = 1; i < pos; i++) ans.emplace_back(a[i]);
        while (x > 0) {
            ans.emplace_back(min(a[pos] - 1, x));
            x -= min(a[pos] - 1, x);
        }
        sort(ans.rbegin(), ans.rend());
        for (int i : ans) {
            if (i > 0) cout << i << " ";
        }
        cout << "\n";
    }
    return 0;
}