#include<cstdio>
#include<set>
#include<algorithm>

using namespace std;

#define REP(i,n) for(int i = 0; i < (n); ++i)
#define FOR(i,a,b) for(int i = (a); i < (b); ++i)
#define MP make_pair
#define ST first
#define ND second

#define MR 1000010

int n,akt,l,a[10],b[10],i,j;

int main () {
while (1) {
  scanf ("%d",&n);
  if (n==0) break;
  for (i=0;i<n;i++) scanf ("%d %d",&a[i],&b[i]);
  for (i=0;i<n;i++) {
    akt=0;
    for (j=0;j<n;j++) if (j!=i) {
      printf("DUP\n");
      l = a[j]-akt;
      printf("NUM %d\n",abs(l));
      if (l<0) printf("INV\n");
      akt=a[j];
      printf("SUB\n");
    }
    printf("NUM %d\n",b[i]);
    for (j=1;j<n;j++) printf("MUL\n");
    for (j=0;j<n;j++) if (j!=i) {
      l = a[i]-a[j];
      printf("NUM %d\n",abs(l));
      if (l<0) printf("INV\n");
      printf("DIV\n");
    }
    printf("SWP\n");
  }
  printf("POP\n");
  for (i=1;i<n;i++) printf("ADD\n");
  printf("END\n\n");
}
return 0;
}