// combat
#include <fstream>
#include <iostream>
#include <stack>
using namespace std;

enum op{
  DUP=2,ADD=0,SUB=4,MUL=3,DIV=1
};

int inp[10],ans[10],n;
int ansop[10],ansopnum;

bool alpord(int *a,int *b,int n)
{
  for (int i=0;i<n;i++){
    if (a[i]<b[i]) return false;
    else if (a[i]>b[i]) return true;
  }
  return false;
}

void showops(int *ops,int n)
{
  for (int i=0;i<n;i++){
    if (i!=0) cout<<" ";
    switch(ops[i]){
    case DUP: cout<<"DUP";break;
    case ADD: cout<<"ADD";break;
    case SUB: cout<<"SUB";break;
    case MUL: cout<<"MUL";break;
    case DIV: cout<<"DIV";break;
    }
  }
  cout<<endl;
}

void solve(stack<int> &stk,int depth,int *ops,int sans)
{
  if (stk.size()==1&&stk.top()==sans){
    // 答えの候補が見つかった
    //cout<<"found!"<<endl;
    //showops(ops,depth);
    for (int i=0;i<n;i++){
      stack<int> s;
      s.push(inp[i]);

      for (int op=0;op<depth;op++){
        switch(ops[op]){
        case DUP: s.push(s.top()); break;
        case ADD:
          {
            int a=s.top();s.pop();
            int b=s.top();s.pop();
            if (abs(a+b)>30000) goto _next;
            s.push(a+b);
            break;
          }
        case SUB:
          {
            int a=s.top();s.pop();
            int b=s.top();s.pop();
            if (abs(b-a)>30000) goto _next;
            s.push(b-a);
            break;
          }
        case MUL:
          {
            int a=s.top();s.pop();
            int b=s.top();s.pop();
            if (abs(a*b)>30000) goto _next;
            s.push(a*b);
            break;
          }
        case DIV:
          {
            int a=s.top();s.pop();
            int b=s.top();s.pop();
            if (a==0) goto _next;
            if (abs(b/a)>30000) goto _next;
            s.push(b/a);
            break;
          }
        }
      }
      if (s.top()!=ans[i]) goto _next;
    }
    if (ansopnum>depth||(ansopnum==depth&&alpord(ansop,ops,depth))){
      ansopnum=depth;
      for (int o=0;o<depth;o++) ansop[o]=ops[o];
      return;
    }
    else return;
  }
_next:;
  if (depth==10) return;
  if (depth>=ansopnum) return;

  if (stk.size()==1){
    ops[depth]=DUP;
    stk.push(stk.top());
    solve(stk,depth+1,ops,sans);
    stk.pop();
  }
  else{
    if (!(stk.size()>=10-depth+1)){
      ops[depth]=DUP;
      stk.push(stk.top());
      solve(stk,depth+1,ops,sans);
      stk.pop();
    }
    if (stk.size()>=2){
      int ra=stk.top();stk.pop();
      int rb=stk.top();stk.pop();

      if (abs(ra+rb)<=30000){
        ops[depth]=ADD;
        stk.push(ra+rb);
        solve(stk,depth+1,ops,sans);
        stk.pop();
      }
      if (abs(rb-ra)<=30000){
        ops[depth]=SUB;
        stk.push(rb-ra);
        solve(stk,depth+1,ops,sans);
        stk.pop();
      }
      if (abs(ra*rb)<=30000){
        ops[depth]=MUL;
        stk.push(ra*rb);
        solve(stk,depth+1,ops,sans);
        stk.pop();
      }
      if (ra!=0&&abs(rb/ra)<=30000){
        ops[depth]=DIV;
        stk.push(rb/ra);
        solve(stk,depth+1,ops,sans);
        stk.pop();
      }

      stk.push(rb);
      stk.push(ra);
    }
  }
}

int main()
{
  ifstream cin("optimal.txt");

  for (int prob=1;;prob++){
    cin>>n;
    if (n==0) break;
    int i;

    for (i=0;i<n;i++) cin>>inp[i];
    for (i=0;i<n;i++) cin>>ans[i];

    stack<int> stk;
    stk.push(inp[0]);
    int ops[10]={0};

    ansopnum=11;
    solve(stk,0,ops,ans[0]);

    cout<<"Program "<<prob<<endl;
    if (ansopnum==11) cout<<"Impossible"<<endl;
    else if (ansopnum==0) cout<<"Empty Sequence"<<endl;
    else showops(ansop,ansopnum);
    cout<<endl;
  }
  return 0;
}