
    In a smart parking management system, determine the number of compatible parking space pairs that can be managed together based on their binary occupancy sensor readings. Given a list of sensor readings where each reading is either 0 (vacant) or 1 (occupied), count how many pairs of parking spaces can be efficiently co-managed, where two spaces are considered compatible for joint management if their sensor values XORed together result in an even number. The count of such compatible pairs will help optimize the dynamic allocation strategy for the parking system.
    

    
def find_even_pair(A):
    """
    In a smart parking management system, determine the number of compatible parking space pairs that can be managed together based on their binary occupancy sensor readings. Given a list of sensor readings where each reading is either 0 (vacant) or 1 (occupied), count how many pairs of parking spaces can be efficiently co-managed, where two spaces are considered compatible for joint management if their sensor values XORed together result in an even number. The count of such compatible pairs will help optimize the dynamic allocation strategy for the parking system.
    

    """
def find_even_pair(A):
    """
    In a smart parking management system, determine the number of compatible parking space pairs that can be managed together based on their binary occupancy sensor readings. Given a list of sensor readings where each reading is either 0 (vacant) or 1 (occupied), count how many pairs of parking spaces can be efficiently co-managed, where two spaces are considered compatible for joint management if their sensor values XORed together result in an even number. The count of such compatible pairs will help optimize the dynamic allocation strategy for the parking system.
    

    """
    count = 0
    for i in range(0, len(A)):
        for j in range(i + 1, len(A)):
            if (A[i] ^ A[j]) % 2 == 0:
                count += 1
    return count