------
## 最终结论
```python
def find_min_moves(machines):
    total_dresses = sum(machines)
    n = len(machines)
    
    if total_dresses % n != 0:
        return -1  # Cannot evenly distribute dresses
    
    target = total_dresses // n
    max_moves = 0
    current_flow = 0
    
    for dresses in machines:
        current_flow += dresses - target
        max_moves = max(max_moves, abs(current_flow), dresses - target)
    
    return max_moves

# Example usage:
print(find_min_moves([1,0,5]))  # Output: 3
print(find_min_moves([0,3,0]))  # Output: 2
print(find_min_moves([0,2,0]))  # Output: -1
```