#include <bits/stdc++.h>
using namespace std;
int n,A[100100];
int fun()
{
int ans=0;
int count=0;
for(int i=1;i<=n;i++)
{
if(A[i]==1)
{
count++;
ans=max(ans,count);
}
else
{
count=0;
}
}
return ans;
}
int main() {
cin>>n;
int ans=0;
for(int i=1;i<=n;i++)
{
cin>>A[i];
}
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
swap(A[i], A[j]);
ans=max(ans, fun());
swap(A[i], A[j]);
}
}
cout<<ans<<endl;
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbixBWzEwMDEwMF07CmludCBmdW4oKQp7CglpbnQgYW5zPTA7CglpbnQgY291bnQ9MDsKCWZvcihpbnQgaT0xO2k8PW47aSsrKQoJewoJCWlmKEFbaV09PTEpCgkJewoJCQljb3VudCsrOwoJCQlhbnM9bWF4KGFucyxjb3VudCk7CgkJfQoJCWVsc2UKCQl7CgkJCWNvdW50PTA7CgkJfQoJfQoJcmV0dXJuIGFuczsKfQoKaW50IG1haW4oKSB7CgljaW4+Pm47CglpbnQgYW5zPTA7Cglmb3IoaW50IGk9MTtpPD1uO2krKykKCXsKCQljaW4+PkFbaV07Cgl9Cglmb3IoaW50IGk9MTtpPD1uO2krKykKCXsKCQlmb3IoaW50IGo9MTtqPD1uO2orKykKCQl7CgkJCXN3YXAoQVtpXSwJQVtqXSk7CgkJCWFucz1tYXgoYW5zLAlmdW4oKSk7CgkJCQlzd2FwKEFbaV0sCUFbal0pOwoJCQkKCQl9Cgl9Cgljb3V0PDxhbnM8PGVuZGw7CgkKCXJldHVybiAwOwp9