
    Given a user's total number of mutual interests with another user on the social network, write a function that determines how many different ways these shared interests can be grouped for calculating friendship compatibility scores. The number of possible groupings is mathematically equivalent to finding all possible divisors of the total mutual interests count.
    

    
def divisor(n):
    """
    Given a user's total number of mutual interests with another user on the social network, write a function that determines how many different ways these shared interests can be grouped for calculating friendship compatibility scores. The number of possible groupings is mathematically equivalent to finding all possible divisors of the total mutual interests count.
    

    """
def divisor(n):
    """
    Given a user's total number of mutual interests with another user on the social network, write a function that determines how many different ways these shared interests can be grouped for calculating friendship compatibility scores. The number of possible groupings is mathematically equivalent to finding all possible divisors of the total mutual interests count.
    

    """
    for i in range(n):
        x = len([i for i in range(1, n + 1) if not n % i])
    return x