def solve(strengths):
    strengths.sort()
    n = len(strengths)
    
    # Calculate the prefix sums of strengths
    prefix_sums = [0] * (n + 1)
    for i in range(n):
        prefix_sums[i + 1] = prefix_sums[i] + strengths[i]
    
    # Find the number of animals that will remain
    remaining = 0
    for i in range(n):
        if prefix_sums[i] > prefix_sums[n] - prefix_sums[i + 1]:
            remaining = n - i
            break
    
    return remaining

# Read the input
n = int(input())
strengths = [int(input()) for _ in range(n)]

# Solve the problem
result = solve(strengths)

# Print the output
print(result)