```python
import collections

def find_Sum(arr, n):
    """
    Finds the sum of repeated elements in a given array.

    Args:
        arr: A list of numbers.
        n: The number of elements in the array (unused in this implementation
           as len(arr) is preferred in Python, but included for signature compliance).

    Returns:
        The sum of elements that appear more than once in the array.
        Each repeated element is added to the sum only once.
    """
    
    # Use collections.Counter to efficiently count the frequency of each element.
    # For example, [1, 2, 1, 3, 4, 4] becomes Counter({1: 2, 4: 2, 2: 1, 3: 1})
    frequency = collections.Counter(arr)
    
    # Initialize the sum for repeated elements.
    repeated_sum = 0
    
    # Iterate through the unique elements and their counts.
    for number, count in frequency.items():
        # If an element appears more than once, it's a repeated element.
        if count > 1:
            # Add the element's value to the sum.
            repeated_sum += number
            
    return repeated_sum

```