吾是最帅的，还不快快跪拜！！！！！！！！！````| | | | | col | col | col | | - | - | - | | content | content | content | | col | col | col | col | col | | - | - | - | - | - | - | | content | content | content | content | content | content | | content | content | content | content | content | content | | col | col | col | col | col | | - | - | - | - | - | - | | content | content | content | content | content | content | | content | content | content | content | content | content | | content | content | content | content | content | content | | col | col | col | | - | - | - | - | | content | content | content | content | | content | content | content | content | | content | content | content | content | | col | col | | - | - | - | | content | content | content | | content | content | content |`

#include <bits/stdc++.h>
using namespace std;
const int N=1e5;
int a[N];
int main(){
	int n;
	cin>>n;
	int mx=0;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		if(a[i]>mx){
			mx=a[i];
		}
	}
	cout<<mx<<endl<<endl;
	int cnt=1;
	int ji=0;
	int cnt2=2;
	for(int i=n-1;i>=1;i--){
		cout<<mx-cnt<<" ";
		cnt++;
		ji++;
		if(ji==cnt2){
			cout<<endl<<endl;
			cnt2++;
			ji=0;
		}
	}
	return 0;
}