
    Given the total number of posts in a content moderation batch, find the sum of all even divisors that can be used to organize posts into equal-sized groups for parallel processing by moderators. The solution will help determine optimal group sizes for distributing the workload among available moderators while maintaining balanced processing capacity.
    

    
import math

def sumofFactors(n):
    """
    Given the total number of posts in a content moderation batch, find the sum of all even divisors that can be used to organize posts into equal-sized groups for parallel processing by moderators. The solution will help determine optimal group sizes for distributing the workload among available moderators while maintaining balanced processing capacity.
    

    """
import math

def sumofFactors(n):
    """
    Given the total number of posts in a content moderation batch, find the sum of all even divisors that can be used to organize posts into equal-sized groups for parallel processing by moderators. The solution will help determine optimal group sizes for distributing the workload among available moderators while maintaining balanced processing capacity.
    

    """
    if n % 2 != 0:
        return 0
    res = 1
    for i in range(2, int(math.sqrt(n)) + 1):
        count = 0
        curr_sum = 1
        curr_term = 1
        while n % i == 0:
            count = count + 1
            n = n // i
            if i == 2 and count == 1:
                curr_sum = 0
            curr_term = curr_term * i
            curr_sum = curr_sum + curr_term
        res = res * curr_sum
    if n >= 2:
        res = res * (1 + n)
    return res