//排序加上upper_bound
include[HTML_REMOVED]
include[HTML_REMOVED]
using namespace std;
int a[10];
int main(){
for(int i=0;i<10;i++)
cin>>a[i];
int hi;
cin>>hi;
hi+=30;
sort(a,a+10);
int pos=(upper_bound(a,a+10,hi)-a);
cout<<pos<<endl;
return 0;
}