#include<bits/stdc++.h>
#define ALL(v) std::begin(v),std::end(v)
using lint=long long;
using ld=long double;
template<class T>using numr=std::numeric_limits<T>;
int main(){
    std::cin.tie(nullptr);std::ios_base::sync_with_stdio(false);
    std::cout.setf(std::ios_base::fixed);std::cout.precision(15);
    lint n;std::cin>>n;
    std::vector<lint>a(n+1),b(n+1),d(n);
    for(lint&x:a)std::cin>>x;
    for(lint&x:b)std::cin>>x;
    for(lint&x:d)std::cin>>x;
    std::sort(ALL(d));
    std::map<std::tuple<lint,lint,lint>,lint>map;
    auto ok=[&](lint c)->bool{
        std::vector<std::vector<lint>>dp(n+1,std::vector<lint>(n+1,-1));
        auto dfs=[&](auto&&f,lint i,lint j)->bool{
            lint&x=dp.at(i).at(j);
            if(x!=-1)return x;
            lint k=c-i-j;
            return x=k==0
                ||d.at(k-1)<=a.at(i+1)+b.at(j)&&f(f,i+1,j)
                ||d.at(k-1)<=a.at(i)+b.at(j+1)&&f(f,i,j+1);
        };
        return dfs(dfs,0,0);
    };
    lint l=0,r=n+1;
    while(1<r-l){
        lint c=(l+r)/2;
        (ok(c)?l:r)=c;
    }
    std::cout<<l<<'\n';
}