Number of Perfect Pairs

You are given an integer array nums.
A pair of indices (i, j) is called balanced perfect if the following conditions hold:
1. i < j
2. Let a = nums[i] and b = nums[j]. Then:
o min(|a - b|, |a + b|) <= min(|a|, |b|)
o max(|a - b|, |a + b|) >= max(|a|, |b|)
Your task is to count how many distinct balanced perfect pairs exist in the array.
Note:
The absolute value |x| refers to the non-negative value of x.