#define debug if(0)
#include<cstdio>
#include<stack>
#include<algorithm>
#include<cctype>
#include<vector>
#include<string>
using namespace std;

#define REP(i,n) for(int i = 0;i<(n);i++)
#define FOREACH(it,u) for(vector <int> ::iterator it = u.begin();it != u.end();it++)
#define PB push_back

const int MOD = 257;

bool solve(){
	int n;
	scanf("%d", &n);
	if (n == 0)
		return false;
	REP(i,n) {
		int u, v;
		scanf("%d %d", &u, &v);
		printf("DUP\n");
		printf("NUM %d\n", u);
		printf("SUB\n");
		for(int i = 0;i<8;i++) {
			printf("DUP\n");
			printf("MUL\n");
			printf("NUM %d\n", MOD);
			printf("MOD\n");
		}
		printf("NUM 1\n");
		printf("SUB\n");
		printf("INV\n");
		printf("NUM %d\n", v);
		printf("MUL\n");
		printf("SWP\n");
	}
	printf("DUP\n");
	printf("SUB\n");
	REP(i,n)
		printf("ADD\n");
	printf("END\n\n");
	return true;
}

int main(){
	while(1){
		if(!solve()) break;
	}
	return 0;
}