Problem: Professor Abacus has just built a new computing engine for making numerical tables. It was designed to calculate the values of a polynomial function in one variable at several points at a time. With the polynomial function f(x) = x2 + 2x + 1, for instance, a possible expected calculation result is 1 (= f(0)), 4 (= f(1)), 9 (= f(2)), 16 (= f(3)), and 25 (= f(4)).

It is a pity, however, the engine seemingly has faulty components and exactly one value among those calculated simultaneously is always wrong. With the same polynomial function as above, it can, for instance, output 1, 4, 12, 16, and 25 instead of 1, 4, 9, 16, and 25.

You are requested to help the professor identify the faulty components. As the first step, you should write a program that scans calculation results of the engine and finds the wrong values.



Input

The input is a sequence of datasets, each representing a calculation result in the following format.

d
v0
v1
...
vd+2


Here, d in the first line is a positive integer that represents the degree of the polynomial, namely, the highest exponent of the variable. For instance, the degree of 4x5 + 3x + 0.5 is five and that of 2.4x + 3.8 is one. d is at most five.

The following d + 3 lines contain the calculation result of f(0), f(1), ... , and f(d + 2) in this order, where f is the polynomial function. Each of the lines contains a decimal fraction between -100.0 and 100.0, exclusive.

You can assume that the wrong value, which is exactly one of f(0), f(1), ... , and f(d+2), has an error greater than 1.0. Since rounding errors are inevitable, the other values may also have errors but they are small and never exceed 10-6.

The end of the input is indicated by a line containing a zero.

Output

For each dataset, output i in a line when vi is wrong.

Example

Input

2
1.0
4.0
12.0
16.0
25.0
1
-30.5893962764
5.76397083962
39.3853798058
74.3727663177
4
42.4715310246
79.5420238202
28.0282396675
-30.3627807522
-49.8363481393
-25.5101480106
7.58575761381
5
-21.9161699038
-48.469304271
-24.3188578417
-2.35085940324
-9.70239202086
-47.2709510623
-93.5066246072
-82.5073836498
0


Output

2
1
1
6

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#include <stdlib.h>
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
typedef vector<double> Vec;
typedef vector<Vec> Mat;
typedef pair<ll,ll> P;
typedef pair<double,ll> Pd;
typedef priority_queue<P,vector<P>,greater<P>> P_queue;
typedef priority_queue<Pd,vector<Pd>,greater<Pd>> Pd_queue;

const ll MOD=998244353;
const ll mod=1000000007;
const ll INF=1e15;
const double DEL=1e-3;
vec dx={1,0,-1,0};
vec dy={0,1,0,-1};

#define REP(i,a,b) for(int i=(int)a;i<(int)b;i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define mp make_pair
#define ALL(a) a.begin(),a.end()
#define SORT(a) sort(ALL(a))
#define U_ERASE(V) V.erase(unique(ALL(V)), V.end());
#define ADD(a,b) a=(a+b)%mod
#define CHECK cout<<"arrived"<<endl

ll ruijou(ll n, ll k){
    if(!k) return 1;
    ll a=ruijou(n,k/2);
    a=(a*a);
    return k%2 ? (a*n) : a;
}

Mat mul(Mat &A, Mat &B){
    Mat C(A.size(), Vec(B[0].size()));
    for(int i=0;i<A.size();i++){
        for(int k=0;k<B.size();k++){
            for(int j=0;j<B[0].size();j++){
                C[i][j]=(C[i][j]+A[i][k]*B[k][j]);
            }
        }
    }
    return C;
}

Vec mulvec(Mat &A, Vec B){
    Vec C(A.size(),0);
    rep(i,A.size()){
        rep(j,B.size()) C[i]+=A[i][j]*B[j];
    }
    return C;
}
Vec gauss_jordan(const Mat &A, const Vec &b){
    ll N=A.size();
    Mat B(N,Vec(N+1,0));
    rep(i,N) rep(j,N) B[i][j]=A[i][j];
    rep(i,N) B[i][N]=b[i];
    rep(i,N){
        ll pivot=i;
        REP(j,i,N) if(abs(B[j][i])>abs(B[pivot][i])) pivot=j;
        swap(B[i],B[pivot]);
        if(abs(B[i][i])<DEL) return Vec();
        REP(j,i+1,N+1) B[i][j]/=B[i][i];
        rep(j,N) if(i!=j){
            REP(k,i+1,N+1) B[j][k]-=B[j][i]*B[i][k];
        }
    }
    Vec x(N);
    rep(i,N) x[i]=B[i][N];
    return x;
}

Mat Create(ll N, ll k, ll l){
    Mat C(N, Vec(N,1));
    vec x;
    rep(i,N+2) if(i!=k && i!=l) x.pb(i);
    rep(i,N) REP(j,1,N) C[i][j]=C[i][j-1]*x[i];
    return C;
}


ll Solving(ll N, ll k, ll l, Vec a){
    Mat C=Create(N,k,l);
    Vec b;
    rep(i,a.size()) if(i!=k && i!=l) b.pb(a[i]);
    Vec x=gauss_jordan(C,b);
    double ret=0;
    rep(i,N) ret+=x[i]*ruijou(k,i);
    //CHECK;
    if(abs(ret-a[k])<DEL) return l;
    ret=0;
    rep(i,N) ret+=x[i]*ruijou(l,i);
    if(abs(ret-a[l])<DEL) return k;
    return -1;
}

ll Solve(ll N){
    Vec a(N+2);
    rep(i,N+2) cin>>a[i];
    for(int i=0;i<N+1;i+=2){
        ll p=Solving(N,i,i+1,a);
        if(p>=0) return p;
    }
    return N+1;
}

int main(){
    vec ans;
    while(true){
        ll N; cin>>N;
        if(!N) break;
        ans.pb(Solve(N+1));
    }
    rep(i,ans.size()) cout<<ans[i]<<endl;
}