#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) ((int)a.size())
const int mod = 998244353, N = 100007;

int main() {
	ios::sync_with_stdio(false), cin.tie(0);
	int n;
	cin >> n, --n;
	vector <int> a(n);
	for (int i = 0; i < n; ++i) {
		cin >> a[i];
	}
	a[0] = 1;
	if (count(all(a), 1) == n) {
		cout << "1\n";
		return 0;
	}
	int ans = 2;
	for (int i = n - 1; ~i; --i) {
		if (a[i] == 0) {
			ans = max(ans, n - i + 1);
		} else {
			break;
		}
	}
	cout << ans << '\n';
}