binary

#include<bits/stdc++.h>
using namespace std;
int main()
{
    int n,i,j,k,a[1000],mid,key=23;
    cin>>n;
    for(i=0; i<n; i++)
    {
        cin>>a[i];
    }
    mid = 0+n-1/2;
    if(key < a[mid])
    {

        for(i=0; i<mid; i++)
        {
            if(a[i]==key)
                cout<<i<<endl;

            else
                cout<<"none"<<endl;


        }
    }
    else if(key>a[mid])
    {
        for(i=mid; i<n-1; i++)
        {
            if(a[i]==key)
                cout<<i<<endl;

            else
                cout<<"none"<<endl;


        }
    }
    else if(key==a[mid])
        cout<<"found"<<endl;
    else
        cout<<"none"<<endl;

    return 0;
}