#include <bits/stdc++.h>
using namespace std;
#define ll long long
int check(vector<string> action,vector<int> exp, vector<int> levels){
int ans =0, ce= 0;
for (int i=0;i<action.size();i++){
int n = stoi(action[i]+ string());
if (ce<=levels[n]) {ans += 1; ce += exp[n];}
else break;
}
return ans;
}
int gen(string s,vector<int> exp, vector<int> levels){
int ans =0;
string a,b,c,d,e,f,g,h,z;
if (s.size()==1){
vector<vector<string>> y= {{"0"}};
for (int i =0;i<y.size();i++){
ans = max(ans,check(y[i],exp,levels));
}
}
else if (s.size() ==2){
vector<vector<string>> y= {{"0","1"},{"1","0"}};
for (int i =0;i<y.size();i++){
ans = max(ans,check(y[i],exp,levels));}
}
else if (s.size() ==3){
vector<vector<string>> y={{"0","1","2"},{"0","2","1"},{"1","2","0"},{"1","0","2"},{"2","0","1"},{"2","1","0"}};
for (int i =0;i<y.size();i++){
ans = max(ans,check(y[i],exp,levels));}
}
else if (s.size() ==4){
for (int i =0;i<s.size(); i++)
for (int j =1;j<s.size(); j++)
for (int k =2;k<s.size(); k++){
vector<string> t = {"0","1","2","3"};
a= t[i];
t[i] = t[0]; t[0] = a;
b= t[j];
t[j] = t[1]; t[1] = b;
c= t[k];
t[k] = t[2]; t[2] = c;
ans = max(ans,check(t,exp,levels));
}
}
else if (s.size() ==5){
for (int i =0;i<s.size(); i++)
for (int j =1;j<s.size(); j++)
for (int k =2;k<s.size(); k++)
for (int l =3;l<s.size(); l++){
vector<string> t = {"0","1","2","3","4"};
a= t[i];
t[i] = t[0]; t[0] = a;
b= t[j];
t[j] = t[1]; t[1] = b;
c= t[k];
t[k] = t[2]; t[2] = c;
d= t[l];
t[l]= t[3]; t[3] = d;
ans = max(ans,check(t,exp,levels));
}
}
else if (s.size() ==6){
for (int i =0;i<s.size(); i++)
for (int j =1;j<s.size(); j++)
for (int k =2;k<s.size(); k++)
for (int l =3;l<s.size(); l++)
for (int m =4;m<s.size(); m++){
vector<string> t = {"0","1","2","3","4","5"};
a= t[i];
t[i] = t[0]; t[0] = a;
b= t[j];
t[j] = t[1]; t[1] = b;
c= t[k];
t[k] = t[2]; t[2] = c;
d= t[l];
t[l]= t[3]; t[3] = d;
e = t[m];
t[m] = t[4]; t[4] = e;
ans = max(ans,check(t,exp,levels));
}
}
else if (s.size() ==7){
for (int i =0;i<s.size(); i++)
for (int j =1;j<s.size(); j++)
for (int k =2;k<s.size(); k++)
for (int l =3;l<s.size(); l++)
for (int m =4;m<s.size(); m++)
for (int n =5;n<s.size(); n++){
vector<string> t = {"0","1","2","3","4","5","6"};
a= t[i];
t[i] = t[0]; t[0] = a;
b= t[j];
t[j] = t[1]; t[1] = b;
c= t[k];
t[k] = t[2]; t[2] = c;
d= t[l];
t[l]= t[3]; t[3] = d;
e = t[m];
t[m] = t[4]; t[4] = e;
f = t[n];
t[n] = t[5]; t[5] = f;
ans = max(ans,check(t,exp,levels));
}
}
else if (s.size() ==8){
for (int i =0;i<s.size(); i++)
for (int j =1;j<s.size(); j++)
for (int k =2;k<s.size(); k++)
for (int l =3;l<s.size(); l++)
for (int m =4;m<s.size(); m++)
for (int n =5;n<s.size(); n++)
for (int o =6;o<s.size(); o++){
vector<string> t = {"0","1","2","3","4","5","6","7"};
a= t[i];
t[i] = t[0]; t[0] = a;
b= t[j];
t[j] = t[1]; t[1] = b;
c= t[k];
t[k] = t[2]; t[2] = c;
d= t[l];
t[l]= t[3]; t[3] = d;
e = t[m];
t[m] = t[4]; t[4] = e;
f = t[n];
t[n] = t[5]; t[5] = f;
g = t[o];
t[o] = t[6]; t[6] = g;
ans = max(ans,check(t,exp,levels));
}
}
else if (s.size() ==9){
for (int i =0;i<s.size(); i++)
for (int j =1;j<s.size(); j++)
for (int k =2;k<s.size(); k++)
for (int l =3;l<s.size(); l++)
for (int m =4;m<s.size(); m++)
for (int n =5;n<s.size(); n++)
for (int o =6;o<s.size(); o++)
for (int p =7;p<s.size(); p++){
vector<string> t = {"0","1","2","3","4","5","6","7","8"};
a= t[i];
t[i] = t[0]; t[0] = a;
b= t[j];
t[j] = t[1]; t[1] = b;
c= t[k];
t[k] = t[2]; t[2] = c;
d= t[l];
t[l]= t[3]; t[3] = d;
e = t[m];
t[m] = t[4]; t[4] = e;
f = t[n];
t[n] = t[5]; t[5] = f;
g = t[o];
t[o] = t[6]; t[6] = g;
h = t[p];
t[p] = t[7]; t[7] = h;
ans = max(ans,check(t,exp,levels));
}
}
else if (s.size() ==10){
for (int i =0;i<s.size(); i++)
for (int j =1;j<s.size(); j++)
for (int k =2;k<s.size(); k++)
for (int l =3;l<s.size(); l++)
for (int m =4;m<s.size(); m++)
for (int n =5;n<s.size(); n++)
for (int o =6;o<s.size(); o++)
for (int p =7;p<s.size(); p++)
for (int q =8;q<s.size(); q++){
vector<string> t = {"0","1","2","3","4","5","6","7","8","9"};
a= t[i];
t[i] = t[0]; t[0] = a;
b= t[j];
t[j] = t[1]; t[1] = b;
c= t[k];
t[k] = t[2]; t[2] = c;
d= t[l];
t[l]= t[3]; t[3] = d;
e = t[m];
t[m] = t[4]; t[4] = e;
f = t[n];
t[n] = t[5]; t[5] = f;
g = t[o];
t[o] = t[6]; t[6] = g;
h = t[p];
t[p] = t[7]; t[7] = h;
z= t[q];
t[q] = t[8]; t[8] = q;
ans = max(ans,check(t,exp,levels));
}
}
return ans;
}
int main(){
ios::sync_with_stdio(false);
int n,x,ce=0,c=0; cin>>n;
vector<int> exp, levels;
for (int i =0; i<n; i++){
cin>>x;
exp.push_back(x);}
for (int i =0; i<n; i++){
cin>>x;
levels.push_back(x);
}
if (n<=10){
string z="";
int m =0;
for (int i=0; i<n;i++){z+="1";}
cout<<gen(z,exp,levels);}
else{
sort(exp.begin(),exp.end());
while (ce<=levels[0]){
if (c==n){break;}
ce += exp[c];
c+=1;
}
cout<<c;}
}