A tunnel has N lamps. Each lamp is either working (1) or broken (0). The maintenance team can temporarily fix at most one broken lamp. Find the longest continuous bright segment possible after this one fix.

The intuition trap: you do not need to actually flip every zero and test again.

The first line contains KaTeX can only parse string typed expression. For each test case, the first line contains KaTeX can only parse string typed expression. The second line contains KaTeX can only parse string typed expression binary integers.

For each test case, print the maximum length of a continuous segment containing only KaTeX can only parse string typed expressions after flipping at most one KaTeX can only parse string typed expression.