Here is a sequence with n integers in it. Each of the integers is 1 or -1.

You have to rearrange the sequence, to get the maximum interval sum to be MINIMUM.

I would like to know how many arrangements there are.