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

    left, right = 0, len(A) - 1

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

        mid = (left + right) // 2
        next_idx = (mid + 1) % len(A)
        prev_idx = (mid - 1 + len(A)) % len(A)

        if A[mid] <= A[next_idx] and A[mid] <= A[prev_idx]:
            return mid

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

    return 0