#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;

bool vis[MAX];
vector<int> pier;

void set_pier()
{
	for(int i=2; i<MAX; i++) {
		if(!vis[i]) {
			pier.psh(i);
			for(int j=i; j<MAX; j+=i) vis[j]=1;
		}
	}
}

struct coile {
	int kiedy, cykl;
} rob[5];

long long znajdz(coile no[], int rr) {
	long long wyn = no[0].kiedy;
	long long raz = no[0].cykl;
	for (int i = 1; i < rr; ++i) {
		int zl = 0;
		while (wyn >= 0LL && wyn % no[i].cykl != no[i].kiedy && zl < no[i].cykl) {
			wyn += raz;
			++zl;
		}
		if (zl == no[i].cykl || wyn < 0LL)
			return -1;
		raz *= no[i].cykl;
	}
	return wyn;
}

vector<int> V,Z;
PII dane[20];

int main()
{
	set_pier();
	
	int n,a,b;
	while(1)
	{
		koniec:
		Z.clear();
		scanf("%d", &n);
		if(n==0) return 0;
		FOR(i,n) {
			scanf("%d%d", &dane[i].frs,&dane[i].sec);
			Z.psh(dane[i].frs + 1);
		}
		
		REP(q,2000) {
			REP(w,2000) {
				int l = w + q;
				int k = w;
				V.clear();
				FOR(i,n) V.psh(Z[i]);
				a=l;
				FORI(it,V) *it=*it*a;
	
				int b=k;
				FORI(it,V) *it=*it/b;
	
				bool bol=1;
				FOR(i,n) {
					if(V[i]<=dane[i].sec) bol=0;
					for(int j=i+1; j<n; j++) if(__gcd(V[i],V[j])!=1) bol=0;
				}
				if(bol) {
					
					printf("NUM 1\n");
					printf("ADD\n");
					printf("NUM %d\n", a);
					printf("MUL\n");
					printf("NUM %d\n", b);
					printf("DIV\n");
					
					for (int i = 0; i < n; ++i)
						rob[i].kiedy = dane[i].second, rob[i].cykl = V[i];
					printf("NUM %lld\n", znajdz(rob, n));
					printf("SWP\n");
					printf("MOD\n");
					printf("END\n");
					printf("\n");
					
					goto koniec;
				}
			}
		}
		return 7;

	}
}