#include <bits/stdc++.h>
using namespace std;
#define int              long long int
#define double           long double
#define print(a)         for(auto x : a) cout << x << " "; cout << endl


const int M = 1000000007;
const int N = 3e5+9;
const int INF = 2e9+1;
const int LINF = 2000000000000000001;

inline int power(int a, int b, int mod=M) {
    int x = 1;
    a %= mod;
    while (b) {
        if (b & 1) x = (x * a) % mod; 
        a = (a * a) % mod;
        b >>= 1;
    }
    return x;
}


//_ ***************************** START Below *******************************

// 7
// 1 3 4 1 2 3 1


vector<int> a;

//* Ammoritzed O(N)

vector<vector<int>> consistency1(int n){
    unordered_map<int,int> mp;  

    for(int i=0; i<n; i++){
        mp[a[i]]++;
    
    }   

    
    vector<vector<int>> ans;    
    
    for(auto& it : mp){
        int f = it.second;
        int x = it.first;   

    
        int m = ans.size();
        int i = 0;
    
        while(i<min(m, f)){
    
            ans[i].push_back(x);
            i++;
        }               

    
        while(i<f){
            ans.push_back({x});
            i++;
        }   
    }   

    
    return ans;

}



//* Optimized O(N)

vector<vector<int>> consistency2(int n){
	
    vector<vector<int>> ans;    
    unordered_map<int,int> mp;  
    
    for(int i=0; i<n; i++){
    	mp[a[i]]++;
    	int f = mp[a[i]];
    	
    	if(f-1 >= ans.size()){
    		ans.push_back({a[i]});
    	}
    	else{
    		ans[f-1].push_back(a[i]);
    	}
    	
    }

    
    return ans;

}











vector<vector<int>> practice(int n){


}





void solve() {
    
    int n;
    cin>> n;
    
    a.resize(n);
    for(int i=0; i<n; i++) cin >> a[i];
    
    auto ans1 = consistency1(n);
    
    for(int i = 0; i<ans1.size(); i++){
    	sort(begin(ans1[i]), end(ans1[i]));
    	for(auto& t : ans1[i]) cout << t << " ";
    	cout << endl;
    }

    auto ans2 = consistency2(n);
    
    for(int i = 0; i<ans2.size(); i++){
    	sort(begin(ans2[i]), end(ans2[i]));
    	for(auto& t : ans2[i]) cout << t << " ";
    	cout << endl;
    }
    
    
}





int32_t main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int t = 1;
    // cin >> t;
    while (t--) {
        solve();
    }

    return 0;
}