public class HighArray {

    public long[] a;
    int nElem;
    public HighArray(int max){
        a=new long[max];
        nElem=0;

    }
    boolean delete (long searchkey){

        int i;
        for( i=0;i<nElem;i++)
            if(a[i]==searchkey)
                break;

            if(i==nElem)
                return false;
            else{
                for(int k=i;k<nElem-1;k++)
                    a[k]=a[k+1];

                nElem--;
                return true;
            }


    }
    boolean find (long searchkey){
        int i;
        for(i=0;i<nElem;i++)
            if(searchkey==a[i])
                break;
        if(i==nElem)
            return false;
        else
            return true;
    }
    void insert(long value){

        a[nElem]=value;
        nElem++;

    }
    void display(){
        int i;
        for(i=0;i<nElem;i++)
            System.out.print(a[i]+"  ");
        System.out.println();
    }

}
class HighArrayApp{

    public static void main(String[]args){
        HighArray array=new HighArray(5);
        array.insert(11);
        array.insert(22);
        array.insert(33);
        array.insert(44);
        array.insert(55);
        System.out.println(array.find(22));
        array.display();
        array.delete(11);
        array.display();
        array.insert(66);
        array.display();
        array.delete(44);
        array.delete(55);
        array.display();
    }

}

long find (long searchkey){

        int lowerBound=0;
        int upperBound=nElem-1;

        while (true){
            int curIn = (lowerBound+upperBound)/2;
            if(a[curIn]==searchkey)
                return a[curIn];
            else if(lowerBound>upperBound)
                    return nElem;
            else {
                if (searchkey < a[curIn])
                    upperBound=curIn-1;
                else
                    lowerBound=curIn+1;
            }

        }


    }