#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <cstdlib>
#include <ctime>
#include <set>
#include <map>
#include<cstring>
#include<cmath>

#define FOR(i,n) for(int i=0; i<n; i++)
#define REP(i,n) for(int i=1; i<=n; i++)
#define FORI(it,n) for(typeof(n.begin()) it=n.begin(); it!=n.end(); it++)
#define psh push_back
#define mkp make_pair
#define frs first
#define sec second

using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
const int MAX = 7100;
const int MAX_I=100100;
const int INF=1000000000;
const LL INF_LL=INF;


int n, mx,indexx, diff, a[111], b[111];
int main()
{
	while(1)
	{
		scanf("%d", &n);
		if(n==0) return 0;
		FOR(i,n) {
			scanf("%d %d", &a[i], &b[i]);
		}
		for (int i=0; i<n; i++) {
			a[i] += 1000;
		}
		printf("NUM 1000\n");
		printf("ADD\n");
		for (int i=0; i<n; i++) {
			mx=-1;
			for (int j=0; j<n; j++)
				if (a[j] > mx) {
					mx = a[j];
					indexx = j;
				}
			printf("DUP\n");
			printf("NUM %d\n", mx);
			printf("DIV\n");
			diff = a[indexx] - b[indexx];
			printf("NUM %d\n", diff);
			printf("MUL\n");
			printf("SUB\n");
			a[indexx] = b[indexx];
		}
		printf("END\n\n");
	}
}