// PollyT.cc
// Polly Nomials problem
// T Feil

#include <iostream>
using namespace std;

int digitsIn(int x){
  int d=1, power=10;
  while(power <= x){
    d++;
    power*= 10;
  }
  return d;
}

int main(){
  int ans, count, a[100], n, x;
  int polly=1;

  cin>>n;
  while(n>0){
    cout<<"Polynomial "<<polly++<<": ";
    for(int i=0;i<=n;i++)
      cin>>a[i];
    cin>>x;

    ans=x;
    count=1;
    for(int i=1;i<n;i++){
      if(a[i]==0){
        ans *= x;
        count += 2;
      }
      else {
        ans = (ans + a[i])*x;
        count = count +3+digitsIn(a[i]);
      }
    }
    //now handle constant term
    if(a[n]==0) count++;   //for = sign
    else {
      ans += a[n];
      count = count + 2 + digitsIn(a[n]);
    }
    cout<<ans<<' '<<count<<endl;

    cin>>n;
  }
  return 0;
}