#include<bits/stdc++.h> using namespace std; int n,a[114514],res[114514]; void dfs(int x,int len,int lst){ if (x > n && len <= 1){ return ; } if (x > n && len >= 2){ for (int i = 1;i <= len;i++){ cout<<res[i]<<' '; } cout<<'\n'; return ; } if (a[x] >= lst){ res[len + 1] = a[x]; dfs(x + 1,len + 1,a[x]); res[len + 1] = 0; } dfs(x + 1,len,lst); } signed main(){ cin>>n; for (int i = 1;i <= n;i++){ cin>>a[i]; } dfs(1,0,0); return 0; }