#include int main() { int n, i, j, l; int be[5], ki[5]; while (1) { scanf("%d", &n); if (n == 0) break; for (i = 0; i < n; ++i) { scanf("%d %d", &(be[i]), &(ki[i])); } if (n == 1) { if (be[0] == ki[0]) { printf("END\n"); } else if (be[0] < ki[0]) { printf("NUM %d\nADD\nEND\n", ki[0] - be[0]); } else { printf("NUM %d\nSUB\nEND\n", be[0] - ki[0]); } } else { for (i = 0; i < n*(n-1)-1; ++i) printf("DUP\n"); for (i = 0; i < n; ++i) { l = 1; printf("NUM %d\n", ki[i]); for (j = 0; j < n; ++j) { if (j == i) continue; l *= (be[i] - be[j]); printf("SWP\nNUM %d\nSUB\nMUL\n", be[j]); } if (l < 0) { printf("NUM %d\nINV\n", -l); } else { printf("NUM %d\n", l); } printf("DIV\nADD\n"); } printf("END\n"); } printf("\n"); } return 0; }