#include <stdio.h>
#include <stdlib.h>

int count=1 ;
int n_coppie, in[20], out[20] ;

#define nop 0
#define add 1
#define div 2
#define dup 3
#define mul 4
#define sub 5
   
int program[50], prog_ok[50] ;
int min_ok_len ;

int stack[100] ;
int n_obj ; /* sullo stack */
int min_ok_len ;

int prog_len()
{
	int l = 0 ;
	while ( program[l]!=nop && l<10 ) {
		l++ ;
	}
	return l ;
}

int run()
{
	int a ;
	for(a=0;a<10;a++) {
		int instr = program[a] ;
		if ( instr==dup ) {
			if ( n_obj < 1 ) return -1 ;
			stack[n_obj] = stack[n_obj-1] ;
			n_obj++ ;
			continue ;
		}
		if ( instr!=nop && n_obj<2 ) return -1 ;
		switch ( program[a] ) {
		case nop: return 0 ;
		case add:
			stack[n_obj-2] += stack[n_obj-1] ;
			break ;
		case div:
			if ( stack[n_obj-1]==0 ) return -1 ;
			stack[n_obj-2] /= stack[n_obj-1] ;
			break ;
		case mul:
			stack[n_obj-2] *= stack[n_obj-1] ;
			break ;
		case sub:
			stack[n_obj-2] -= stack[n_obj-1] ;
			break ;
		}	
		n_obj-- ;
		if ( stack[n_obj-1] < -30000 || stack[n_obj-1] > 30000 )
			return -1 ;
	}
	return 0 ;
}

int test_this()
{
	int a, i, rv ;
	for( a=0 ; a<n_coppie ; a++ ) {
		stack[0] = in[a] ;
		n_obj = 1 ;
		rv = run() ;
		if ( rv==-1 || n_obj!=1 || stack[0]!=out[a] ) return 0 ;
	}	
	for(i=0;i<10;i++) prog_ok[i]=program[i] ;
	min_ok_len = prog_len() ;
	return 1 ;
}

int vai(int i, int j)
{
	int v ;
	if ( i <= j ) {
		for( v=1; v<=5 ; v++ ) {
			program[i] = v ;
			if ( vai( i+1, j ) == 1 ) return 1 ;
		}
	} else	{
		program[i] = nop ;
		return test_this() ;
	}
	return 0 ;
}

void do_all()
{
	int l,i0,i1,i2,i3,i4,i5,i6,i7,i8,i9,a,ignore,j ;
	min_ok_len = 100 ;
	program[0] = dup ;
	for(j=1;j<=9;j++) if ( vai(1,j) ) return ;
}

#if 0
	for(i1=0;i1<=5;i1++)
	for(i2=0;i2<=5;i2++)
	for(i3=0;i3<=5;i3++)
	for(i4=0;i4<=5;i4++)
	for(i5=0;i5<=5;i5++)
	for(i6=0;i6<=5;i6++)
	for(i7=0;i7<=5;i7++)
	for(i8=0;i8<=5;i8++)
	for(i9=0;i9<=5;i9++) {
		program[1] = i1 ;
		program[2] = i2 ;
		program[3] = i3 ;
		program[4] = i4 ;
		program[5] = i5 ;
		program[6] = i6 ;
		program[7] = i7 ;
		program[8] = i8 ;
		program[9] = i9 ;
		ignore = 0 ;
		for(a=1;a<9;a++)
			if ( program[a]==nop && program[a+1]!=nop ) {
				ignore=1;
				break ;
			}
		if (ignore) continue ; 
		l = prog_len() ;
		if (program[l-1]==dup) continue ;
		if (l < min_ok_len)
			test_this() ;
	}
}
#endif

int main()
{
	int a , is_identity ;
	FILE *f = fopen("optimal.in","r") ;
	for(;;) {
		fscanf(f, "%d \n", &n_coppie) ;
		if (n_coppie==0) return 0 ;
		for(a=0;a<n_coppie;a++)
			fscanf(f, "%d ", in+a ) ;
		is_identity=1 ;
		for(a=0;a<n_coppie;a++) {
			fscanf(f, "%d ", out+a ) ;
			if ( out[a]!=in[a] ) is_identity = 0 ;
		}
		printf("Program %d\n",count++) ;
		if ( is_identity ) {
			printf("Empty sequence\n\n") ;
			continue ;
		}
		do_all() ;
		if ( min_ok_len==100 )
			printf("Impossible\n\n") ;
		else	{
			for(a=0;a<10;a++) {
				switch (prog_ok[a]) {
				case add: printf("ADD ") ; break ;
				case div: printf("DIV ") ; break ;
				case dup: printf("DUP ") ; break ;
				case mul: printf("MUL ") ; break ;
				case sub: printf("SUB ") ; break ;
				}
			}
			printf("\n\n") ;
		}
	}
}