#include<iostream>
#include<cstdio>
#include<algorithm>
#include<vector>
#include<map>
using namespace std;
vector<int> a;//苹果和淘淘身高
map<int,int> m;//离散化数组
int n,ans=0;
int main()
{
int t;
for(int i=1;i<=10;++i)
{
scanf("%d",&t);
a.push_back(t);
}
scanf("%d",&n);n+=30;
a.push_back(n);
sort(a.begin(),a.end());
for(int i=0;i<a.size();++i)//离散化存储
{
if(!m.count(a[i])) m[a[i]]=i+1;
a[i]=m[a[i]];
}
for(int i=0;i<a.size();++i)
{
if(a[i]>m.lower_bound(n)->second)
{
cout<<ans-1<<endl;
return 0;
}
else ++ans;
}
}
#include<cstdio>
#include<algorithm>
#include<vector>
#include<map>
using namespace std;
vector<int> a;//苹果和淘淘身高
map<int,int> m;//离散化数组
int n,ans=0;
int main()
{
int t;
for(int i=1;i<=10;++i)
{
scanf("%d",&t);
a.push_back(t);
}
scanf("%d",&n);n+=30;
a.push_back(n);
sort(a.begin(),a.end());
for(int i=0;i<a.size();++i)//离散化存储
{
if(!m.count(a[i])) m[a[i]]=i+1;
a[i]=m[a[i]];
}
for(int i=0;i<a.size();++i)
{
if(a[i]>m.lower_bound(n)->second)
{
cout<<ans-1<<endl;
return 0;
}
else ++ans;
}
}