function BinarySearchCount(A,key)

p = 1
r = length(A)
count = 0

while p<=r
	q = Int.(floor.((p+r)/2))
	if A[q] == key

		for i = p : r
			if A[i] == A[q]
				count = count + 1
			end
		end

		return count
	elseif A[q] > key
		r = q - 1
	else
		p = q + 1
	end
end

return -1

end