#include using namespace std; int main() { int n; cin >> n; int b[n], s[n]; fill(s, s+n, 0); int now_step=0; for(int i=0; i> b[i]; } int nw = b[n-1]; for(int i=n-2; i>=1; i--) { if (b[i] < nw) {s[now_step]=b[i]; now_step++; b[i]=-1;} else nw = b[i]; } //cout << s[0] << s[1] << s[2] << s[3] << endl; for(int i=1; i