def find_rotation_count(A):
    if not A:
        return 0

    left = 0
    right = len(A) - 1

    while left < right:
        if A[left] <= A[right]:
            return left

        mid = (left + right) // 2

        if A[mid] >= A[left]:
            left = mid + 1
        else:
            right = mid

    return left