#include <iostream>

 #include <iomanip>

 using namespace std;

 int _v[];

 //拉格朗日插值算法

 int main()

 {

     //freopen("acm.acm","r",stdin);

     int n;

     int i;

     int j;

     int x;

     double sum;

     double temp;

     while(cin>>n,n)

     {

         for(i = ; i <= n; ++ i)

         {

             cin>>_v[i];

         }

         cin>>x;

         sum = ;

         x += n;

         for(i = ; i <= n; ++ i)

         {

             if(_v[i] != _v[])

             {

                 break;

             }

         }

         if(i > n)

         {

             sum = _v[n];

         }

         else

         {

             for(i = ; i <= n; ++ i)

             {

                 temp = ;

                 for(j = ; j <= n; ++ j)

                 {

                     if(i == j)

                     {

                         continue;

                     }

                     temp *= (x-j);

                     temp /= (i-j);

                 }

                 temp *= _v[i];

                 sum += temp;

             }

         }

         cout<<"Term "<<x<<" of the sequence is ";

         cout<<setiosflags(ios::fixed)<<setprecision()<<sum<<endl;

     }

 }