#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

int N;
pair<LL,LL> io[20];

void gen_prog(int x)
{
	LL denom = 1;
	int last = 0;
	for (int i = 0; i < N; ++i) {
		if (i == x) continue;
		puts("DUP");
		printf("NUM %lld\n", io[i].first - last);
		last = io[i].first;
		denom *= io[x].first - io[i].first;
		printf("SUB\n");
	}
	for (int i = 0; i < N-2; ++i)
		puts("MUL");
	printf("NUM %lld\n", io[x].second);
	printf("MUL\n");
	if (denom >= 0)
		printf("NUM %lld\n", denom);
	else
		printf("NUM 0\nNUM %lld\nSUB\n", -denom);
	printf("DIV\n");
	puts("SWP");
}

int main()
{
	while (true) {
		scanf("%d", &N);
		if (N == 0) break;
		for (int i = 0; i < N; ++i) {
			LL v, r;
			scanf("%lld %lld", &v, &r);
			io[i].first = v;
			io[i].second = r;
		}
		sort(io, io+N);
		if (N == 1) {
			printf("POP\n");
			printf("NUM %lld\n", io[0].second);
			printf("END\n\n");
			continue;
		}
		for (int i = 0; i < N; ++i)
			gen_prog(i);
		puts("POP");
		for (int i = 0; i < N-1; ++i)
			puts("ADD");
		puts("END\n");
	}
	return 0;
}