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

#define stk struct strStack
#define programa struct strPrograma

#define ADD 1
#define SUB 2
#define MUL 3
#define DIV 4
#define DUP 5

programa
{
  int inst[20];
  int length;
}progAct;

stk
{
  int vals[100];
  int sp;
};

FILE* fp;
int numCaso;
int n;
int x[30];
int y[30];
int errFlag;

int le()
{
   int i;
   numCaso++;
   fscanf(fp,"%d\n", &n);

   if (n==0) return 0;
   printf("Program %d\n", numCaso);
   for (i=0;i<n;i++) fscanf(fp, "%d\n", &x[i]);   
   for (i=0;i<n;i++) fscanf(fp, "%d\n", &y[i]);

   return 1;
}

void push(stk* s, int a)
{
  s->vals[++s->sp]=a;
}

int pop(stk* s)
{
  if (s->sp < 0) { errFlag=1; return 0; }
  return s->vals[s->sp--];
}

void add(stk* s)
{
  int a,b;
  a=pop(s);
  b=pop(s);
  push(s,a+b);
}
void sub(stk* s)
{
  int a,b;
  a=pop(s);
  b=pop(s);
  push(s,b-a);
}
void mul(stk* s)
{
  int a,b;
  a=pop(s);
  b=pop(s);
  push(s,a*b);
}
void div2(stk* s)
{
  int a,b;
  a=pop(s);
  b=pop(s);
  if (a==0) { errFlag=1; return;}
  push(s,(int) b/a);
}
void dup(stk* s)
{
  int a;
  a=pop(s);

  push(s,a);  
  push(s,a);
}

void instr(stk* s, int inst)
{

  switch (inst) {
  case MUL: mul(s); break;
  case ADD: add(s); break;
  case SUB: sub(s); break;
  case DIV: div2(s); break;
  case DUP: dup(s); break;
  }
}

void insInst(i)
{
  progAct.inst[progAct.length++]=i;
}

int correcto(stk* vals)
{
  int v;
  for (v=0;v<n;v++) {
    if (vals[v].vals[0]!=y[v]) return 0;
    if (vals[v].sp!=0) return 0;
  }
  return 1;
}


int procura(stk* vals, int d, int maxd)
{
  int i;
  int v;

  stk nvals[30];
  if (correcto(vals)) return 1;
  if (d>maxd) return 0;

  for (i=1;i<6;i++) {
    memcpy(nvals, vals, 30*sizeof(stk));
    errFlag=0;
    for (v=0;v<n&&!errFlag;v++) instr(&nvals[v],i);
    if (!errFlag) {
      if (procura(nvals, d+1, maxd)) { insInst(i); return 1; }
    }
  }
  return 0;
}
void imprimeProgAct()
{
  int i;
  if (progAct.length==0) {
    printf("Empty sequence\n\n");
    return;
  }
  

  for (i=progAct.length;i>=0;i--){
    switch (progAct.inst[i]) {
    case ADD: printf("ADD "); break;
    case SUB: printf("SUB "); break;
    case MUL: printf("MUL "); break;
    case DIV: printf("DIV "); break;
    case DUP: printf("DUP "); break;
    }
  } 

  printf("\n\n");
} 
void resolve()
{
  int prof;
  stk base[30];
  stk vals[30];
  int v;

  for (v=0;v<n;v++) {
    base[v].sp=0;  
    base[v].vals[0]=x[v];
  }
  progAct.length=0;

  for (prof=2;prof<11;prof++) {
    memcpy(vals, base, 30*sizeof(stk));
    if (procura(vals, 1, prof)) { imprimeProgAct(); return; }
  }
  printf("Impossible\n\n");
}


int main()
{
   numCaso=0;
   fp = fopen("optimal.in", "r");
   while (le()) resolve();
   return 0;
}