------
## 最终结论
```python
def get_divisors_sum(n):
    divisors = []
    for i in range(1, int(n**0.5) + 1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:  # Avoid adding the square root twice
                divisors.append(n // i)
    if len(divisors) == 4:
        return sum(divisors)
    return 0

def sum_of_four_divisors(nums):
    total_sum = 0
    for num in nums:
        total_sum += get_divisors_sum(num)
    return total_sum
```