#include <stdio.h>#include <stdlib.h>#include <ctype.h>#include <string.h>#include <math.h>#include <iostream>#include <string>#include <queue>#include <vector>#include <map>#include <set>#include <algorithm>using namespace std;int N;void solve(int n) {int stk1 = 0, stk2 = 0;char str[20];int m;for (int i = 0; i < n; ++i) {scanf("%s%d", str, &m);if (str[0] == 'D') {stk2 += m;printf("DROP 2 %dn", m);} else {if (stk1 >= m) {stk1 -= m;printf("TAKE 1 %dn", m);} else {if (stk1 >= 1)printf("TAKE 1 %dn", stk1);m -= stk1;stk1 = stk2;stk2 = 0;printf("MOVE 2->1 %dn", stk1);stk1 -= m;printf("TAKE 1 %dn", m);}}}}int main(void) {int cas = 0;while (~scanf("%d", &N)) {if (N == 0) break;if (cas++) printf("n");solve(N);}return 0;}
