#include <bits/stdc++.h> using namespace std; const int N = 1e6 + 005; int a[N], n; void dfs(int i, int j) { if (j > n) return; for (int e = i; e <= j; e++) cout << a[e] << " "; cout << endl; if (a[j] <= a[j + 1]) dfs(i, j + 1); } int main() { cin >> n; for (int i = 1; i <= n; i++) cin >> a[i]; for (int i = 1; i < n; i++) if (a[i] <= a[i + 1]) dfs(i, i + 1); }