Last Stone Weight II

Stones have the given weights. In each move two stones of weights x <= y are smashed together: if x == y both are destroyed, otherwise a stone of weight y - x remains. Print the smallest possible weight of the final stone (0 if none remains).

1 <= n <= 30 1 <= weight <= 100