#include<iostream>
#include<cstdio>
#include<map>
#include<vector>
#include<queue>
#include<stack>
#include<cmath>
#include<algorithm>

#define fi first
#define se second
#define REP(i,n) for(int i=0; i<n; i++)

typedef long long ll;
using namespace std;

pair<int,int> ex_res[10];

int main()
{
	int n;
	cin>>n;
	while(n)
	{
		REP(i,n)
		{
			cin>>ex_res[i].fi>>ex_res[i].se;
		}
		REP(i,n-1)
		{
			cout<<"DUP"<<endl;
		}
		REP(i,n)
		{

			if(n!=1)
				cout<<"SWP"<<endl;
			cout<<"NUM "<<ex_res[i].fi-1<<endl;
			cout<<"SUB"<<endl;
			REP(j,9)
			{
				cout<<"NUM "<<10-j<<endl;
				cout<<"MOD"<<endl;
			}
			cout<<"INV"<<endl;
			cout<<"NUM 2"<<endl;
			cout<<"ADD"<<endl;
			REP(j,2)
			{
				cout<<"NUM "<<3-j<<endl;
				cout<<"MOD"<<endl;
			}
			cout<<"NUM "<<ex_res[i].se<<endl;
			cout<<"MUL"<<endl;
			if(i!=0&&n>1)
			{
				cout<<"ADD"<<endl;
			}
		}
		cout<<"END"<<endl<<endl;
		cin>>n;
	}
	return 0;
}