def find_rotation_count(A):
    if not A:
        return 0
    
    n = len(A)
    low, high = 0, n - 1
    
    # If array is not rotated
    if A[low] <= A[high]:
        return 0
    
    while low <= high:
        mid = (low + high) // 2
        
        if A[mid] > A[mid + 1]:
            return mid + 1
        
        if A[mid] < A[low]:
            high = mid - 1
        else:
            low = mid + 1
    
    return 0