#include <iostream>

using namespace std;

class Solution {

public:

    bool binarySearch(int A[],int target,int begin,int end)

    {

        int mid = (begin+end)/;

        if(target == A[mid])

            return true;

        if(target == A[begin])

            return true;

        if(target == A[end])

            return true;

        if(begin>=end)

            return false;

        while(A[begin] == A[mid])

            begin++;

        if(A[begin]<A[mid])//前面有序

        {

            if(target>A[begin] && target<A[mid]) //在前面

                return binarySearch(A,target,begin,mid-);

            else

                return binarySearch(A,target,mid+,end); //在后面

        }

        else if(A[mid]<=A[end])//后面有序

        {

            while(A[mid] == A[end])

                end--;

            if(target>A[mid] && target<A[end]) //在后面

                return binarySearch(A,target,mid+,end);

            else

                return binarySearch(A,target,begin,mid-);//在前面

        }

        return false;

    }

    bool search(int A[], int n, int target) {

       return  binarySearch(A,target,,n-);

    }

};

int main()

{

    Solution myS;

    int A[] = {,,,,};

    bool ans = myS.search(A,,);

    cout<<ans<<endl;

    return ;

}