#include <bits/stdc++.h>
#define F first
#define S second

using namespace std;

int n;
int arr[1000005];
int dp[1000005] = {0};
vector<int> gh[1000005];
priority_queue<pair<int, int>, vector<pair<int, int>>, greater<pair<int, int>>>
    pq;
int ans;
const int N = 1e6 + 5;

signed main() {
    ios::sync_with_stdio(0), cin.tie(0);
    cin >> n;
    dp[2] = 1;
    for (int i = 2; i <= n; i++) {
        cin >> arr[i];
        if (arr[i]) {

            dp[i] = 1;

        } else {
            dp[i] = max(dp[i - 1] + 1, dp[i]);
        }
    }
    cout << dp[n];
    return 0;
}