#include<bits/stdc++.h>
using namespace std;
int a[1005];
int n;
int v[1005];
int main(){
	cin>>n;
	for (int i=1;i<=n;i++){
		cin>>v[i];
		v[i]+=v[i-1];
	}
	for (int i=1;i<=n;i++)
		for (int k=1;k<=i;k++)
			if (v[i]-v[k-1]>=0) a[i]=max(a[i],a[k-1]+1);
	if (a[n]==0) cout<<"Impossible\n";
	else cout<<a[n]<<endl;
	return 0;
}