fibding the largest n integer?

Question

there is a sequence of n intergers. In the sequence, the sum of any 4 consecutive terms is negative, while the sum of any three consecutive terms is positive. what is the largest possible value of n?

sorry for the misspelling, and could you please explain

Answer 1

12 is clearly impossible, because grouping the numbers by 3's should get a positive sum, but they can also be grouped by 4's to get a negative sum so the sum would be both positive and negative which is impossible.

I am not sure how to construct a sequence of length 11 though. The best I can do now is length 5:

-2, -2, 5, -2, -2